59 for (
auto iter = order.
cbegin(); iter != order.
cend(); ++iter) {
60 _DiGraph__graph.addNodeWithId(iter.key());
StructuralConstraintSliceOrder & operator=(const StructuralConstraintSliceOrder &from)
copy operator
NodeProperty< NodeId > _SliceOrder__order
slices to which belong the nodes
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
StructuralConstraintDiGraph & operator=(const StructuralConstraintDiGraph &from)
copy operator
The class for generic Hash Tables.
const const_iterator & cend() const noexcept
Returns the unsafe const_iterator pointing to the end of the hashtable.
Base class for all oriented graphs.
const_iterator cbegin() const
Returns an unsafe const_iterator pointing to the beginning of the hashtable.
virtual ~StructuralConstraintSliceOrder()
destructor
StructuralConstraintSliceOrder()
default constructor
The base class for structural constraints used by learning algorithms that learn a directed graph str...
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
the structural constraint imposing a partial order over nodes