aGrUM 3.2.0
a C++ library for (probabilistic) graphical models
gum::UndiGraph Member List

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

_addHole_(NodeId id)gum::NodeGraphPartprivate
_boundVal_gum::NodeGraphPartprivate
_checkNeighbours_(NodeId id)gum::EdgeGraphPartprivate
_clearEdges_()gum::EdgeGraphPartprivate
_clearNodes_()gum::NodeGraphPartprivate
_cloneNames_() constgum::NodeGraphPartprivate
_edges_gum::EdgeGraphPartprivate
_endIteratorSafe_gum::NodeGraphPartprivate
_eraseHole_(NodeId id)gum::NodeGraphPartprivate
_holes_gum::NodeGraphPartprivate
_holes_resize_policy_gum::NodeGraphPartprivate
_holes_size_gum::NodeGraphPartprivate
_inHoles_(NodeId id) constgum::NodeGraphPartprivate
_names_gum::NodeGraphPartprivate
_neighbours_gum::EdgeGraphPartprivate
_sizeHoles_() constgum::NodeGraphPartprivate
_updateEndIteratorSafe_()gum::NodeGraphPartprivate
addEdge(NodeId first, NodeId second) overridegum::UndiGraphvirtual
addNode()gum::NodeGraphPartvirtual
addNodes(Size n)gum::NodeGraphPart
addNodeWithId(const NodeId id)gum::NodeGraphPartvirtual
asNodeSet() constgum::NodeGraphPart
begin() const noexceptgum::NodeGraphPart
beginSafe() constgum::NodeGraphPart
bound() constgum::NodeGraphPart
chainComponents() constgum::UndiGraph
clear() overridegum::UndiGraphvirtual
clearEdges()gum::EdgeGraphPartvirtual
clearNodes()gum::NodeGraphPartvirtual
completeGraph(int n)gum::UndiGraphstatic
connectedComponents() constgum::UndiGraph
dotNodeLabel(NodeId id) constgum::NodeGraphPart
EdgeGraphPart(Size edges_size=HashTableConst::default_size, bool edges_resize_policy=true)gum::EdgeGraphPartexplicit
EdgeGraphPart(const EdgeGraphPart &s)gum::EdgeGraphPart
EdgeGraphPart(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
emptyEdges() constgum::EdgeGraphPart
emptyNodes() constgum::NodeGraphPart
end() const noexceptgum::NodeGraphPart
endSafe() const noexceptgum::NodeGraphPart
eraseEdge(const Edge &edge)gum::EdgeGraphPartvirtual
eraseNeighbours(NodeId id)gum::EdgeGraphPart
eraseNode(NodeId id) overridegum::UndiGraphvirtual
exists(const NodeId id) constgum::NodeGraphPart
existsEdge(const Edge &edge) constgum::EdgeGraphPart
existsEdge(NodeId n1, NodeId n2) constgum::EdgeGraphPart
existsNode(const NodeId id) constgum::NodeGraphPart
hasName(NodeId id) constgum::NodeGraphPart
hasUndirectedCycle() constgum::UndiGraph
hasUndirectedPath(NodeId n1, NodeId n2) constgum::UndiGraph
hasUndirectedPath(NodeId n1, NodeId n2, const NodeSet &except) constgum::UndiGraph
hasUndirectedPath(const NodeSet &n1, const NodeSet &n2, const NodeSet &except) constgum::UndiGraph
idFromName(const std::string &name) constgum::NodeGraphPart
listMapEdges(VAL(*f)(const Edge &)) constgum::EdgeGraphPart
listMapNodes(VAL(*f)(const NodeId &)) constgum::NodeGraphPart
nameFromId(NodeId id) constgum::NodeGraphPart
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
NodeGraphPart(const NodeGraphPart &s)gum::NodeGraphPart
NodeGraphPart(NodeGraphPart &&s)gum::NodeGraphPart
NodeIterator typedefgum::NodeGraphPart
NodeIteratorSafe typedefgum::NodeGraphPart
nodes() constgum::NodeGraphPart
nodesPropertyFromFunction(VAL(*f)(const NodeId &), Size size=0) constgum::NodeGraphPart
nodesPropertyFromVal(const VAL &a, Size size=0) constgum::NodeGraphPart
onEdgeAddedgum::EdgeGraphPart
onEdgeDeletedgum::EdgeGraphPart
onNodeAddedgum::NodeGraphPart
onNodeDeletedgum::NodeGraphPart
operator=(const UndiGraph &g)gum::UndiGraph
operator=(UndiGraph &&g)gum::UndiGraph
gum::NodeGraphPart::operator=(const NodeGraphPart &p)gum::NodeGraphPart
gum::NodeGraphPart::operator=(NodeGraphPart &&p)gum::NodeGraphPart
gum::EdgeGraphPart::operator=(const EdgeGraphPart &s)gum::EdgeGraphPart
gum::EdgeGraphPart::operator=(EdgeGraphPart &&s)gum::EdgeGraphPart
operator==(const UndiGraph &g) constgum::UndiGraph
gum::NodeGraphPart::operator==(const NodeGraphPart &p) constgum::NodeGraphPart
gum::EdgeGraphPart::operator==(const EdgeGraphPart &p) constgum::EdgeGraphPart
partialUndiGraph(NodeSet nodes)gum::UndiGraphvirtual
populateNodes(const NodeGraphPart &s)gum::NodeGraphPart
populateNodesFromProperty(const NodeProperty< T > &h)gum::NodeGraphPart
setName(NodeId id, const std::string &name)gum::NodeGraphPart
size() constgum::NodeGraphPart
sizeEdges() constgum::EdgeGraphPart
sizeNodes() constgum::NodeGraphPart
toDot() constgum::UndiGraphvirtual
toString() const overridegum::UndiGraphvirtual
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
UndiGraph(UndiGraph &&g)gum::UndiGraph
undirectedPath(NodeId node1, NodeId node2) constgum::UndiGraph
unvirtualizedEraseNeighbours(NodeId id)gum::EdgeGraphPart
~EdgeGraphPart()gum::EdgeGraphPartvirtual
~NodeGraphPart()gum::NodeGraphPartvirtual
~UndiGraph() overridegum::UndiGraph