49#ifndef GUM_ESSENTIALGRAPH_H
50#define GUM_ESSENTIALGRAPH_H
90 std::string
toDot()
const;
Class representing probabilistic DAG model.
Base classes for partially directed acyclic graphs.
Virtual base class for PGMs using a DAG.
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()
NodeId idFromName(const std::string &name) const
wrappping DAGModel::idFromName()
const NodeSet & children(NodeId id) const
wrapping MixedGraph::parents(id)
Size sizeArcs() const
wrapping MixedGraph::sizeArcs()
const ArcSet & arcs() const
wrapping MixedGraph::arcs()
const DAGmodel * _dagmodel_
const NodeSet & parents(NodeId id) const
wrapping MixedGraph::parents(id)
UndiGraph skeleton() const
const NodeGraphPart & nodes() const
wrapping MixedGraph::nodes()
Size size() const
wrapping MixedGraph::size()
void _buildEssentialGraph_()
EssentialGraph & operator=(const EssentialGraph &g)
bool _strongly_protected_(NodeId a, NodeId b) const
std::string toDot() const
const EdgeSet & edges() const
wrapping MixedGraph::edges()
Size sizeNodes() const
wrapping MixedGraph::sizeNodes()
Base class for mixed graphs.
Class for node sets in graph.
Base class for partially directed acyclic graphs.
Base class for undirected graphs.
Inline implementation of the 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 ...
Set< NodeId > NodeSet
Some typdefs and define for shortcuts ...
gum is the global namespace for all aGrUM entities