aGrUM 2.3.2
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.

_arcs_gum::ArcGraphPartprivate
_checkChildren_(NodeId id)gum::ArcGraphPartprivate
_checkNeighbours_(NodeId id)gum::EdgeGraphPartprivate
_checkParents_(NodeId id)gum::ArcGraphPartprivate
_children_gum::ArcGraphPartprivate
_clearEdges_()gum::EdgeGraphPartprivate
_edges_gum::EdgeGraphPartprivate
_neighbours_gum::EdgeGraphPartprivate
_parents_gum::ArcGraphPartprivate
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
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
boundary(NodeId node) constgum::MixedGraph
chainComponent(NodeId node) constgum::MixedGraph
children(const NodeSet &ids) constgum::ArcGraphPart
children(NodeId id) constgum::ArcGraphPart
clear() overridegum::MixedGraphvirtual
clearArcs()gum::ArcGraphPart
clearEdges()gum::EdgeGraphPartvirtual
clearNodes()gum::NodeGraphPartvirtual
gum::completeGraph(int n)gum::UndiGraphstatic
gum::DiGraph::completeGraph(int n)gum::DiGraphstatic
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 &val, 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(NodeId id)gum::EdgeGraphPart
eraseNode(const NodeId node) overridegum::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(NodeId n1, NodeId n2) constgum::EdgeGraphPart
existsNode(const NodeId id) constgum::NodeGraphPart
family(NodeId id) constgum::ArcGraphPart
family(const NodeSet &ids) constgum::ArcGraphPart
hasDirectedPath(NodeId from, NodeId to)gum::DiGraph
hasMixedOrientedPath(NodeId node1, NodeId node2) constgum::MixedGraph
hasUndirectedCycle() constgum::UndiGraph
hasUndirectedPath(NodeId n1, NodeId n2) constgum::EdgeGraphPart
hasUndirectedPath(NodeId n1, 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(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
gum::UndiGraph::NodeGraphPart(const NodeGraphPart &s)gum::NodeGraphPart
NodeIterator typedefgum::NodeGraphPart
NodeIteratorSafe typedefgum::NodeGraphPart
nodes() constgum::NodeGraphPart
nodes2ConnectedComponent() constgum::UndiGraph
nodesPropertyFromFunction(VAL(*f)(const NodeId &), Size size=0) constgum::NodeGraphPart
nodesPropertyFromVal(const VAL &a, Size size=0) constgum::NodeGraphPart
onArcAddedgum::ArcGraphPart
onArcDeletedgum::ArcGraphPart
onEdgeAddedgum::EdgeGraphPart
onEdgeDeletedgum::EdgeGraphPart
onNodeAddedgum::NodeGraphPart
onNodeDeletedgum::NodeGraphPart
operator!=(const UndiGraph &g) constgum::UndiGraph
gum::NodeGraphPart::operator!=(const NodeGraphPart &p) constgum::NodeGraphPart
operator=(const MixedGraph &g)gum::MixedGraph
gum::UndiGraph::operator=(const UndiGraph &g)gum::UndiGraph
gum::EdgeGraphPart::operator=(const EdgeGraphPart &s)gum::EdgeGraphPart
gum::DiGraph::operator=(const DiGraph &g)gum::DiGraph
gum::ArcGraphPart::operator=(const ArcGraphPart &s)gum::ArcGraphPart
gum::NodeGraphPart::operator=(const NodeGraphPart &p)gum::NodeGraphPart
operator==(const MixedGraph &g) constgum::MixedGraph
gum::UndiGraph::operator==(const UndiGraph &g) constgum::UndiGraph
gum::EdgeGraphPart::operator==(const EdgeGraphPart &p) constgum::EdgeGraphPart
gum::DiGraph::operator==(const DiGraph &g) constgum::DiGraph
gum::ArcGraphPart::operator==(const ArcGraphPart &p) constgum::ArcGraphPart
gum::NodeGraphPart::operator==(const NodeGraphPart &p) constgum::NodeGraphPart
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() const overridegum::MixedGraphvirtual
topologicalOrder() constgum::DiGraph
toString() const overridegum::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(NodeId node1, NodeId node2) constgum::EdgeGraphPart
unvirtualizedEraseChildren(NodeId id)gum::ArcGraphPart
unvirtualizedEraseNeighbours(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 2.3.2

© PHW&CG&others - 2022
DoXyGeN 1.16.1