Base classes for directed acyclic graphs.
DAG & operator=(const DAG &g)
copy operator
DAG(Size nodes_size=HashTableConst::default_size, bool nodes_resize_policy=true, Size arcs_size=HashTableConst::default_size, bool arcs_resize_policy=true)
default constructor
void addArc(NodeId tail, NodeId head) final
insert a new arc into the directed graph
bool hasDirectedPath(NodeId from, NodeId to)
checks whether there exists a directed path from from to to
DiGraph & operator=(const DiGraph &g)
copy operator
virtual void addArc(const NodeId tail, const NodeId head)
insert a new arc into the directed graph
Exception : existence of a directed cycle in a graph.
#define GUM_ERROR(type, msg)
Size NodeId
Type for node ids.
gum is the global namespace for all aGrUM entities