71 return _pdag_.neighbours(
id);
97 return _pdag_.connectedComponents();
const NodeSet & neighbours(NodeId id) const
wrapping MixedGraph::parents(id)
const std::string & nameFromId(NodeId node) const
wrappping .name()
Size sizeEdges() const
wrapping MixedGraph::sizeEdges()
const NodeSet & children(NodeId id) const
wrapping MixedGraph::parents(id)
NodeProperty< NodeId > connectedComponents() const
Returns the connected components of the essential graph. Each node maps to the id of its component ro...
Size sizeArcs() const
wrapping MixedGraph::sizeArcs()
const ArcSet & arcs() const
wrapping MixedGraph::arcs()
const DAGmodel * _dagmodel_
NodeId idFromName(std::string_view name) const
wrappping DAGModel::idFromName()
const NodeSet & parents(NodeId id) const
wrapping MixedGraph::parents(id)
const NodeGraphPart & nodes() const
wrapping MixedGraph::nodes()
NodeSet descendants(NodeId id) const
wrapping PDAG::descendants(id)
NodeSet ancestors(NodeId id) const
wrapping PDAG::ancestors(id)
Size size() const
wrapping MixedGraph::size()
const EdgeSet & edges() const
wrapping MixedGraph::edges()
Size sizeNodes() const
wrapping MixedGraph::sizeNodes()
Class for node sets in graph.
Base class for partially directed acyclic graphs.
Class building the essential Graph from a DAGmodel.
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Set< Edge > EdgeSet
Some typdefs and define for shortcuts ...
Size NodeId
Type for node ids.
Set< Arc > ArcSet
Some typdefs and define for shortcuts ...
HashTable< NodeId, VAL > NodeProperty
Property on graph elements.
Set< NodeId > NodeSet
Some typdefs and define for shortcuts ...
gum is the global namespace for all aGrUM entities