55# define GUM_DFS_CODE_H
147 using iterator = std::vector< EdgeCode* >::iterator;
166# ifndef GUM_NO_INLINE
Inline implementation of the DFSCode class.
Reprensent a Depth First Search coding of a graph.
DFSCode & operator=(const DFSCode &source)
Copy operator.
std::vector< EdgeCode * > codes
The vector containing the EdgeCode composing this DFSCode.
bool operator==(const DFSCode &code) const
Equality operator.
std::vector< EdgeCode * >::const_iterator const_iterator
Code alias.
bool operator<=(const DFSCode &code) const
Lesser or equal than operator.
std::vector< EdgeCode * >::iterator iterator
Code alias.
bool operator!=(const DFSCode &code) const
Difference operator.
DFSCode()
Default constructor.
static bool validNeighbors(EdgeCode *e1, EdgeCode *e2)
Returns true of e2 is a valid neighbor for e1 (i.e.
bool operator<(const DFSCode &code) const
Lesser than operator.
Headers of the EdgeCode class.
std::ostream & operator<<(std::ostream &out, const DFSCode &code)
Print code in out.
namespace for all probabilistic relational models entities
gum is the global namespace for all aGrUM entities
represent a DFS code used by gspan.