aGrUM  0.13.2
essentialGraph_inl.h
Go to the documentation of this file.
1 /***************************************************************************
2  * Copyright (C) 2005 by Christophe GONZALES and Pierre-Henri WUILLEMIN *
3  * {prenom.nom}_at_lip6.fr *
4  * *
5  * This program is free software; you can redistribute it and/or modify *
6  * it under the terms of the GNU General Public License as published by *
7  * the Free Software Foundation; either version 2 of the License, or *
8  * (at your option) any later version. *
9  * *
10  * This program is distributed in the hope that it will be useful, *
11  * but WITHOUT ANY WARRANTY; without even the implied warranty of *
12  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
13  * GNU General Public License for more details. *
14  * *
15  * You should have received a copy of the GNU General Public License *
16  * along with this program; if not, write to the *
17  * Free Software Foundation, Inc., *
18  * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
19  ***************************************************************************/
27 // to ease parsing by IDE
29 
30 namespace gum {
31 
33 
34  INLINE const NodeSet& EssentialGraph::parents(const NodeId id) const {
35  return __mg.parents(id);
36  }
37 
38  INLINE const NodeSet& EssentialGraph::children(const NodeId id) const {
39  return __mg.children(id);
40  }
41 
42  INLINE const NodeSet& EssentialGraph::neighbours(const NodeId id) const {
43  return __mg.neighbours(id);
44  }
45 
46 
47  INLINE Size EssentialGraph::sizeArcs() const { return __mg.sizeArcs(); }
48 
49  INLINE const ArcSet& EssentialGraph::arcs() const { return __mg.arcs(); }
50 
51  INLINE Size EssentialGraph::sizeEdges() const { return __mg.sizeEdges(); }
52 
53  INLINE const EdgeSet& EssentialGraph::edges() const { return __mg.edges(); }
54 
55  INLINE Size EssentialGraph::sizeNodes() const { return __mg.sizeNodes(); }
56 
57  INLINE Size EssentialGraph::size() const { return __mg.size(); }
58 
59  INLINE const NodeGraphPart& EssentialGraph::nodes() const {
60  return __mg.nodes();
61  }
62 } // namespace gum
Size sizeNodes() const
returns the number of nodes in the NodeGraphPart
unsigned long Size
In aGrUM, hashed values are unsigned long int.
Definition: types.h:50
Size size() const
wrapping MixedGraph::size()
const EdgeSet & edges() const
returns the set of edges stored within the EdgeGraphPart
unsigned int NodeId
Type for node ids.
Definition: graphElements.h:97
Size sizeEdges() const
indicates the number of edges stored within the EdgeGraphPart
const NodeSet & parents(const NodeId id) const
wrapping MixedGraph::parents(id)
Size sizeArcs() const
wrapping MixedGraph::sizeArcs()
gum is the global namespace for all aGrUM entities
Definition: agrum.h:25
const NodeSet & neighbours(const NodeId id) const
returns the set of edges adjacent to a given node
const NodeSet & children(const NodeId id) const
wrapping MixedGraph::parents(id)
const ArcSet & arcs() const
wrapping MixedGraph::arcs()
Class building the essential Graph from a DAGmodel.
const ArcSet & arcs() const
returns the set of arcs stored within the ArcGraphPart
Size sizeEdges() const
wrapping MixedGraph::sizeEdges()
const NodeSet & parents(const NodeId id) const
returns the set of nodes with arc ingoing to a given node
Size size() const
alias for sizeNodes
Class for node sets in graph.
const EdgeSet & edges() const
wrapping MixedGraph::edges()
Size sizeNodes() const
wrapping MixedGraph::sizeNodes()
const NodeSet & children(const NodeId id) const
returns the set of nodes with arc outgoing from a given node
Size sizeArcs() const
indicates the number of arcs stored within the ArcGraphPart
const NodeSet & neighbours(const NodeId id) const
wrapping MixedGraph::parents(id)
const NodeGraphPart & nodes() const
return *this as a NodeGraphPart
const NodeGraphPart & nodes() const
wrapping MixedGraph::nodes()
Base class for mixed graphs.
Definition: mixedGraph.h:124