78 for (
auto iter = order.
cbegin(); iter != order.
cend(); ++iter) {
79 _DiGraph_graph_.addNodeWithId(iter.key());
Base class for all oriented graphs.
const_iterator cbegin() const
Returns an unsafe const_iterator pointing to the beginning of the hashtable.
const const_iterator & cend() const noexcept
Returns the unsafe const_iterator pointing to the end of the hashtable.
The base class for structural constraints used by learning algorithms that learn a directed graph str...
StructuralConstraintDiGraph & operator=(const StructuralConstraintDiGraph &from)
copy operator
the structural constraint imposing a partial order over nodes
NodeProperty< NodeId > _SliceOrder_order_
slices to which belong the nodes
StructuralConstraintSliceOrder & operator=(const StructuralConstraintSliceOrder &from)
copy operator
StructuralConstraintSliceOrder()
default constructor
virtual ~StructuralConstraintSliceOrder()
destructor
HashTable< NodeId, VAL > NodeProperty
Property on graph elements.
include the inlined functions if necessary
gum is the global namespace for all aGrUM entities
the structural constraint imposing a partial order over nodes
the structural constraint imposing a partial order over nodes