aGrUM  0.16.0
essentialGraph_inl.h
Go to the documentation of this file.
1 
30 // to ease parsing by IDE
32 
33 namespace gum {
34 
36 
37  INLINE const NodeSet& EssentialGraph::parents(const NodeId id) const {
38  return __mg.parents(id);
39  }
40 
41  INLINE const NodeSet& EssentialGraph::children(const NodeId id) const {
42  return __mg.children(id);
43  }
44 
45  INLINE const NodeSet& EssentialGraph::neighbours(const NodeId id) const {
46  return __mg.neighbours(id);
47  }
48 
49 
50  INLINE Size EssentialGraph::sizeArcs() const { return __mg.sizeArcs(); }
51 
52  INLINE const ArcSet& EssentialGraph::arcs() const { return __mg.arcs(); }
53 
54  INLINE Size EssentialGraph::sizeEdges() const { return __mg.sizeEdges(); }
55 
56  INLINE const EdgeSet& EssentialGraph::edges() const { return __mg.edges(); }
57 
58  INLINE Size EssentialGraph::sizeNodes() const { return __mg.sizeNodes(); }
59 
60  INLINE Size EssentialGraph::size() const { return __mg.size(); }
61 
62  INLINE const NodeGraphPart& EssentialGraph::nodes() const {
63  return __mg.nodes();
64  }
65 } // namespace gum
const NodeGraphPart & nodes() const
wrapping MixedGraph::nodes()
const NodeSet & parents(const NodeId id) const
wrapping MixedGraph::parents(id)
const NodeSet & neighbours(const NodeId id) const
wrapping MixedGraph::parents(id)
Size size() const
alias for sizeNodes
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
Definition: agrum.h:25
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
const NodeSet & neighbours(const NodeId id) const
returns the set of edges adjacent to a given node
Size size() const
wrapping MixedGraph::size()
const EdgeSet & edges() const
returns the set of edges stored within the EdgeGraphPart
Size sizeEdges() const
wrapping MixedGraph::sizeEdges()
Size sizeArcs() const
indicates the number of arcs stored within the ArcGraphPart
Size sizeArcs() const
wrapping MixedGraph::sizeArcs()
Size sizeNodes() const
wrapping MixedGraph::sizeNodes()
const EdgeSet & edges() const
wrapping MixedGraph::edges()
const NodeSet & parents(const NodeId id) const
returns the set of nodes with arc ingoing to a given node
const NodeGraphPart & nodes() const
return *this as a NodeGraphPart
Class for node sets in graph.
Size sizeNodes() const
returns the number of nodes in the NodeGraphPart
const NodeSet & children(const NodeId id) const
returns the set of nodes with arc outgoing from a given node
const ArcSet & arcs() const
returns the set of arcs stored within the ArcGraphPart
Size sizeEdges() const
indicates the number of edges stored within the EdgeGraphPart
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Definition: types.h:48
const NodeSet & children(const NodeId id) const
wrapping MixedGraph::parents(id)
const ArcSet & arcs() const
wrapping MixedGraph::arcs()
Size NodeId
Type for node ids.
Definition: graphElements.h:98
Base class for mixed graphs.
Definition: mixedGraph.h:127