48#ifndef GUM_EDGE_CODE_H
49#define GUM_EDGE_CODE_H
Inline implementation of the EdgeCode class.
some utils for topology : NodeId, Edge, Arc and consorts ...
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Size NodeId
Type for node ids.
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.
Size l_i
The label of the first node in the code.
NodeId i
The DFS subscript of the first node in the code.
bool operator==(const EdgeCode &code) const
Equality operator.
Size l_ij
The label of the edge in the code.
std::string name
The string version of this EdgeCode.
bool isForward() const
Returns true if this EdgeCode is a forward edge.
EdgeCode(NodeId i, NodeId j, Size l_i, Size l_ij, Size l_j)
Default constructor.
NodeId j
The DFS subscript of the second node in the code.
bool isBackward() const
Returns true if this EdgeCode is a backward edge.
EdgeCode & operator=(const EdgeCode &source)
Copy operator.
bool operator<(const EdgeCode &code) const
Lesser than operator.
bool operator!=(const EdgeCode &code) const
Difference operator.
Size l_j
The label of the second node in the code.