145 bool nodes_resize_policy =
true,
147 bool arcs_resize_policy =
true,
149 bool edges_resize_policy =
true);
249 std::string
toDot()
const override;
Base classes for directed acyclic graphs.
Inline implementation of Base classes for directed acylic graphs.
MixedGraph(Size nodes_size=HashTableConst::default_size, bool nodes_resize_policy=true, Size arcs_size=HashTableConst::default_size, bool arcs_resize_policy=true, Size edges_size=HashTableConst::default_size, bool edges_resize_policy=true)
default constructor
const NodeGraphPart & nodes() const
return *this as a NodeGraphPart
void addEdge(NodeId first, NodeId second) final
insert a new edge into the partially directed graph
std::string toDot() const override
to friendly display mixed graph in DOT format
void addArc(NodeId tail, NodeId head) final
insert a new arc into the directed graph
UndiGraph moralizedAncestralGraph(const NodeSet &nodes) const
build a UndiGraph by moralizing the Ancestral Graph of a set of Nodes
PDAG & operator=(const PDAG &g)
copy operator
PDAG(Size nodes_size=HashTableConst::default_size, bool nodes_resize_policy=true, Size arcs_size=HashTableConst::default_size, bool arcs_resize_policy=true, Size edges_size=HashTableConst::default_size, bool edges_resize_policy=true)
default constructor
UndiGraph moralGraph() const
build a UndiGraph by moralizing the PDAG
bool hasMixedReallyOrientedPath(NodeId n1, NodeId n2) const
returns true if a mixed edge/directed arc path from node1 to node2 in the arc/edge set exists with at...
bool cSeparation(NodeId X, NodeId Y, const NodeSet &Z) const
check if node X and node Y are independent given nodes Z (in the sense of c-separation)
virtual ~PDAG()
destructor
Base class for undirected graphs.
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Size NodeId
Type for node ids.
Set< NodeId > NodeSet
Some typdefs and define for shortcuts ...
Base classes for mixed directed/undirected graphs.
gum is the global namespace for all aGrUM entities
static constexpr Size default_size
The default number of slots in hashtables.