aGrUM  0.20.3
a C++ library for (probabilistic) graphical models
gum::MixedGraph Member List

This is the complete list of members for gum::MixedGraph, including all inherited members.

addArc(const NodeId tail, const NodeId head)gum::DiGraphvirtual
addEdge(NodeId first, NodeId second) overridegum::UndiGraphvirtual
addNode()gum::NodeGraphPartvirtual
addNodes(Size n)gum::NodeGraphPart
addNodeWithId(const NodeId id)gum::NodeGraphPartvirtual
adjacents(const NodeId id) constgum::MixedGraph
ancestors(NodeId id) constgum::ArcGraphPart
ArcGraphPart(Size arcs_size=HashTableConst::default_size, bool arcs_resize_policy=true)gum::ArcGraphPartexplicit
ArcGraphPart(const ArcGraphPart &s)gum::ArcGraphPart
ArcIterator typedefgum::ArcGraphPart
arcs() constgum::ArcGraphPart
arcsProperty(VAL(*f)(const Arc &), Size size=0) constgum::ArcGraphPart
arcsProperty(const VAL &a, Size size=0) constgum::ArcGraphPart
asNodeSet() constgum::NodeGraphPart
begin() const noexceptgum::NodeGraphPart
beginSafe() constgum::NodeGraphPart
bound() constgum::NodeGraphPart
children(const NodeSet &ids) constgum::ArcGraphPart
children(NodeId id) constgum::ArcGraphPart
clear()gum::MixedGraphvirtual
clearArcs()gum::ArcGraphPart
clearEdges()gum::EdgeGraphPartvirtual
clearNodes()gum::NodeGraphPartvirtual
descendants(NodeId id) constgum::ArcGraphPart
DiGraph(Size nodes_size=HashTableConst::default_size, bool nodes_resize_policy=true, Size arcs_size=HashTableConst::default_size, bool arcs_resize_policy=true)gum::DiGraphexplicit
DiGraph(const DiGraph &g)gum::DiGraph
directedPath(NodeId node1, NodeId node2) constgum::ArcGraphPart
directedUnorientedPath(NodeId node1, NodeId node2) constgum::ArcGraphPart
EdgeGraphPart(Size edges_size=HashTableConst::default_size, bool edges_resize_policy=true)gum::EdgeGraphPartexplicit
EdgeGraphPart(const EdgeGraphPart &s)gum::EdgeGraphPart
EdgeIterator typedefgum::EdgeGraphPart
edges() constgum::EdgeGraphPart
edgesProperty(VAL(*f)(const Edge &), Size size=0) constgum::EdgeGraphPart
edgesProperty(const VAL &a, Size size=0) constgum::EdgeGraphPart
empty() constgum::NodeGraphPart
emptyArcs() constgum::ArcGraphPart
emptyEdges() constgum::EdgeGraphPart
emptyNodes() constgum::NodeGraphPart
end() const noexceptgum::NodeGraphPart
endSafe() const noexceptgum::NodeGraphPart
eraseArc(const Arc &arc)gum::ArcGraphPartvirtual
eraseChildren(NodeId id)gum::ArcGraphPart
eraseEdge(const Edge &edge)gum::EdgeGraphPartvirtual
eraseNeighbours(const NodeId id)gum::EdgeGraphPart
eraseNode(const NodeId id)gum::MixedGraphvirtual
eraseParents(NodeId id)gum::ArcGraphPart
eraseSetOfArcs_(const ArcSet &set)gum::ArcGraphPartprotected
exists(const NodeId id) constgum::NodeGraphPart
existsArc(const Arc &arc) constgum::ArcGraphPart
existsArc(NodeId tail, NodeId head) constgum::ArcGraphPart
existsEdge(const Edge &edge) constgum::EdgeGraphPart
existsEdge(const NodeId n1, const NodeId n2) constgum::EdgeGraphPart
existsNode(const NodeId id) constgum::NodeGraphPart
family(NodeId id) constgum::ArcGraphPart
family(const NodeSet &ids) constgum::ArcGraphPart
hasDirectedPath(const NodeId from, const NodeId to)gum::DiGraph
hasUndirectedCycle() constgum::UndiGraph
hasUndirectedPath(const NodeId n1, const NodeId n2) constgum::EdgeGraphPart
hasUndirectedPath(const NodeId n1, const NodeId n2, const NodeSet &except) constgum::EdgeGraphPart
hasUndirectedPath(const NodeSet &n1, const NodeSet &n2, const NodeSet &except) constgum::EdgeGraphPart
listMapArcs(VAL(*f)(const Arc &)) constgum::ArcGraphPart
listMapEdges(VAL(*f)(const Edge &)) constgum::EdgeGraphPart
listMapNodes(VAL(*f)(const NodeId &)) constgum::NodeGraphPart
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)gum::MixedGraphexplicit
MixedGraph(const UndiGraph &g)gum::MixedGraphexplicit
MixedGraph(const DiGraph &g)gum::MixedGraphexplicit
MixedGraph(const MixedGraph &g)gum::MixedGraph
mixedOrientedPath(NodeId node1, NodeId node2) constgum::MixedGraph
mixedUnorientedPath(NodeId node1, NodeId node2) constgum::MixedGraph
neighbours(const NodeId id) constgum::EdgeGraphPart
nextNodeId() constgum::NodeGraphPart
node_const_iterator typedefgum::NodeGraphPart
node_const_iterator_safe typedefgum::NodeGraphPart
node_iterator typedefgum::NodeGraphPart
node_iterator_safe typedefgum::NodeGraphPart
NodeConstIterator typedefgum::NodeGraphPart
NodeConstIteratorSafe typedefgum::NodeGraphPart
NodeGraphPart(Size holes_size=HashTableConst::default_size, bool holes_resize_policy=true)gum::NodeGraphPartexplicit
NodeGraphPart(const NodeGraphPart &s)gum::NodeGraphPart
NodeIterator typedefgum::NodeGraphPart
NodeIteratorSafe typedefgum::NodeGraphPart
nodes() constgum::NodeGraphPart
nodes2ConnectedComponent() constgum::UndiGraph
nodesProperty(VAL(*f)(const NodeId &), Size size=0) constgum::NodeGraphPart
nodesProperty(const VAL &a, Size size=0) constgum::NodeGraphPart
onArcAddedgum::ArcGraphPart
onArcDeletedgum::ArcGraphPart
onEdgeAddedgum::EdgeGraphPart
onEdgeDeletedgum::EdgeGraphPart
onNodeAddedgum::NodeGraphPart
onNodeDeletedgum::NodeGraphPart
operator!=(const MixedGraph &g) constgum::MixedGraph
gum::UndiGraph::operator!=(const UndiGraph &g) constgum::UndiGraph
gum::NodeGraphPart::operator!=(const NodeGraphPart &p) constgum::NodeGraphPart
gum::EdgeGraphPart::operator!=(const EdgeGraphPart &p) constgum::EdgeGraphPart
gum::DiGraph::operator!=(const DiGraph &g) constgum::DiGraph
gum::ArcGraphPart::operator!=(const ArcGraphPart &p) constgum::ArcGraphPart
operator=(const MixedGraph &g)gum::MixedGraph
gum::UndiGraph::operator=(const UndiGraph &g)gum::UndiGraph
gum::NodeGraphPart::operator=(const NodeGraphPart &p)gum::NodeGraphPart
gum::EdgeGraphPart::operator=(const EdgeGraphPart &s)gum::EdgeGraphPart
gum::DiGraph::operator=(const DiGraph &g)gum::DiGraph
gum::ArcGraphPart::operator=(const ArcGraphPart &s)gum::ArcGraphPart
operator==(const MixedGraph &g) constgum::MixedGraph
gum::UndiGraph::operator==(const UndiGraph &g) constgum::UndiGraph
gum::NodeGraphPart::operator==(const NodeGraphPart &p) constgum::NodeGraphPart
gum::EdgeGraphPart::operator==(const EdgeGraphPart &p) constgum::EdgeGraphPart
gum::DiGraph::operator==(const DiGraph &g) constgum::DiGraph
gum::ArcGraphPart::operator==(const ArcGraphPart &p) constgum::ArcGraphPart
parents(NodeId id) constgum::ArcGraphPart
parents(const NodeSet &ids) constgum::ArcGraphPart
partialUndiGraph(NodeSet nodes)gum::UndiGraphvirtual
populateNodes(const NodeGraphPart &s)gum::NodeGraphPart
populateNodesFromProperty(const NodeProperty< T > &h)gum::NodeGraphPart
size() constgum::NodeGraphPart
sizeArcs() constgum::ArcGraphPart
sizeEdges() constgum::EdgeGraphPart
sizeNodes() constgum::NodeGraphPart
toDot() constgum::MixedGraphvirtual
topologicalOrder(bool clear=true) constgum::DiGraph
toString() constgum::MixedGraphvirtual
UndiGraph(Size nodes_size=HashTableConst::default_size, bool nodes_resize_policy=true, Size edges_size=HashTableConst::default_size, bool edges_resize_policy=true)gum::UndiGraphexplicit
UndiGraph(const UndiGraph &g)gum::UndiGraph
undirectedPath(const NodeId node1, const NodeId node2) constgum::EdgeGraphPart
unvirtualizedEraseChildren(NodeId id)gum::ArcGraphPart
unvirtualizedEraseNeighbours(const NodeId id)gum::EdgeGraphPart
unvirtualizedEraseParents(NodeId id)gum::ArcGraphPart
unvirtualizedEraseSetOfArcs_(const ArcSet &set)gum::ArcGraphPartprotected
~ArcGraphPart()gum::ArcGraphPartvirtual
~DiGraph()gum::DiGraphvirtual
~EdgeGraphPart()gum::EdgeGraphPartvirtual
~MixedGraph()gum::MixedGraphvirtual
~NodeGraphPart()gum::NodeGraphPartvirtual
~UndiGraph()gum::UndiGraphvirtual
aGrUM 0.20.3
Mon Jun 7 2021 17:34:51
© PHW&CG&others - 2021
DoXyGeN 1.8.13