Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Static Public Member Functions
relation::IsReflexive Class Reference

#include <IsReflexive.h>

Static Public Member Functions

template<class T >
static bool isReflexive (const ext::set< ext::pair< T, T > > &relation, const ext::set< T > &universe)
 

Detailed Description

Computes the complement relation in given universe.

Member Function Documentation

◆ isReflexive()

template<class T >
bool relation::IsReflexive::isReflexive ( const ext::set< ext::pair< T, T > > &  relation,
const ext::set< T > &  universe 
)
static

Checks whether a relation is reflexive.

Template Parameters
TType of the items in relation.
Parameters
relationthe tested relation
universethe universe of items participating in the relation
Returns
true if the relation is reflexive, false otherwise
Here is the call graph for this function:

The documentation for this class was generated from the following file: