30 #ifndef GUM_ESSENTIALGRAPH_H 31 #define GUM_ESSENTIALGRAPH_H 73 std::string
toDot()
const;
114 #ifndef GUM_NO_INLINE 116 #endif // GUM_NOINLINE 118 #endif // GUM_ESSENTIALGRAPH_H Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
Virtual base class for PGMs using a DAG.
const NodeGraphPart & nodes() const
wrapping MixedGraph::nodes()
const NodeSet & parents(const NodeId id) const
wrapping MixedGraph::parents(id)
EssentialGraph & operator=(const EssentialGraph &g)
const NodeSet & neighbours(const NodeId id) const
wrapping MixedGraph::parents(id)
std::string toDot() const
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.
bool __strongly_protected(NodeId a, NodeId b)
Size size() const
wrapping MixedGraph::size()
const DAGmodel * __dagmodel
UndiGraph skeleton() const
void __buildEssentialGraph()
Size sizeEdges() const
wrapping MixedGraph::sizeEdges()
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
Size sizeArcs() const
wrapping MixedGraph::sizeArcs()
Size sizeNodes() const
wrapping MixedGraph::sizeNodes()
const EdgeSet & edges() const
wrapping MixedGraph::edges()
Class for node sets in graph.
Class building the essential graph from a BN.
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
Base class for undirected graphs.
std::size_t Size
In aGrUM, hashed values are unsigned long int.
const NodeSet & children(const NodeId id) const
wrapping MixedGraph::parents(id)
const ArcSet & arcs() const
wrapping MixedGraph::arcs()
Size NodeId
Type for node ids.
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
Base class for mixed graphs.