_cliques_ | gum::CliqueGraph | private |
_runningIntersectionDFS_(const NodeId clique, const NodeId from, _RunningIntersect_ &infos_DFS) const | gum::CliqueGraph | private |
_separators_ | gum::CliqueGraph | private |
_updateSeparators_(const NodeId clique1) | gum::CliqueGraph | private |
addEdge(const NodeId first, const NodeId second) | gum::CliqueGraph | virtual |
addNode(const NodeSet &clique) | gum::CliqueGraph | |
addNode() | gum::CliqueGraph | virtual |
addNode(const NodeId id, const NodeSet &clique) | gum::CliqueGraph | virtual |
addNode(const NodeId id) | gum::CliqueGraph | virtual |
addNodes(Size n) | gum::NodeGraphPart | |
addNodeWithId(const NodeId id) | gum::NodeGraphPart | virtual |
addToClique(const NodeId clique_id, const NodeId node_id) | gum::CliqueGraph | virtual |
asNodeSet() const | gum::NodeGraphPart | |
begin() const noexcept | gum::NodeGraphPart | |
beginSafe() const | gum::NodeGraphPart | |
bound() const | gum::NodeGraphPart | |
clear() | gum::CliqueGraph | virtual |
clearEdges() | gum::CliqueGraph | virtual |
clearNodes() | gum::NodeGraphPart | virtual |
clique(const NodeId idClique) const | gum::CliqueGraph | |
CliqueGraph(Size nodes_size=HashTableConst::default_size, bool nodes_resize_policy=true, Size edges_size=HashTableConst::default_size, bool edges_resize_policy=true) | gum::CliqueGraph | explicit |
CliqueGraph(const CliqueGraph &from) | gum::CliqueGraph | |
container(const NodeId idNode) const | gum::CliqueGraph | |
containerPath(const NodeId node1, const NodeId node2) const | gum::CliqueGraph | |
EdgeGraphPart(Size edges_size=HashTableConst::default_size, bool edges_resize_policy=true) | gum::EdgeGraphPart | explicit |
EdgeGraphPart(const EdgeGraphPart &s) | gum::EdgeGraphPart | |
EdgeIterator typedef | gum::EdgeGraphPart | |
edges() const | gum::EdgeGraphPart | |
edgesProperty(VAL(*f)(const Edge &), Size size=0) const | gum::EdgeGraphPart | |
edgesProperty(const VAL &a, Size size=0) const | gum::EdgeGraphPart | |
empty() const | gum::NodeGraphPart | |
emptyEdges() const | gum::EdgeGraphPart | |
emptyNodes() const | gum::NodeGraphPart | |
end() const noexcept | gum::NodeGraphPart | |
endSafe() const noexcept | gum::NodeGraphPart | |
eraseEdge(const Edge &edge) | gum::CliqueGraph | virtual |
eraseFromClique(const NodeId clique_id, const NodeId node_id) | gum::CliqueGraph | virtual |
eraseNeighbours(const NodeId id) | gum::EdgeGraphPart | |
eraseNode(const NodeId node) | gum::CliqueGraph | virtual |
exists(const NodeId id) const | gum::NodeGraphPart | |
existsEdge(const Edge &edge) const | gum::EdgeGraphPart | |
existsEdge(const NodeId n1, const NodeId n2) const | gum::EdgeGraphPart | |
existsNode(const NodeId id) const | gum::NodeGraphPart | |
hasRunningIntersection() const | gum::CliqueGraph | |
hasUndirectedCycle() const | gum::UndiGraph | |
hasUndirectedPath(const NodeId n1, const NodeId n2) const | gum::EdgeGraphPart | |
hasUndirectedPath(const NodeId n1, const NodeId n2, const NodeSet &except) const | gum::EdgeGraphPart | |
hasUndirectedPath(const NodeSet &n1, const NodeSet &n2, const NodeSet &except) const | gum::EdgeGraphPart | |
isJoinTree() const | gum::CliqueGraph | |
listMapEdges(VAL(*f)(const Edge &)) const | gum::EdgeGraphPart | |
listMapNodes(VAL(*f)(const NodeId &)) const | gum::NodeGraphPart | |
neighbours(const NodeId id) const | gum::EdgeGraphPart | |
nextNodeId() const | gum::NodeGraphPart | |
node_const_iterator typedef | gum::NodeGraphPart | |
node_const_iterator_safe typedef | gum::NodeGraphPart | |
node_iterator typedef | gum::NodeGraphPart | |
node_iterator_safe typedef | gum::NodeGraphPart | |
NodeConstIterator typedef | gum::NodeGraphPart | |
NodeConstIteratorSafe typedef | gum::NodeGraphPart | |
NodeGraphPart(Size holes_size=HashTableConst::default_size, bool holes_resize_policy=true) | gum::NodeGraphPart | explicit |
NodeGraphPart(const NodeGraphPart &s) | gum::NodeGraphPart | |
NodeIterator typedef | gum::NodeGraphPart | |
NodeIteratorSafe typedef | gum::NodeGraphPart | |
nodes() const | gum::NodeGraphPart | |
nodes2ConnectedComponent() const | gum::UndiGraph | |
nodesProperty(VAL(*f)(const NodeId &), Size size=0) const | gum::NodeGraphPart | |
nodesProperty(const VAL &a, Size size=0) const | gum::NodeGraphPart | |
onEdgeAdded | gum::EdgeGraphPart | |
onEdgeDeleted | gum::EdgeGraphPart | |
onNodeAdded | gum::NodeGraphPart | |
onNodeDeleted | gum::NodeGraphPart | |
operator!=(const CliqueGraph &from) const | gum::CliqueGraph | |
gum::UndiGraph::operator!=(const UndiGraph &g) const | gum::UndiGraph | |
gum::NodeGraphPart::operator!=(const NodeGraphPart &p) const | gum::NodeGraphPart | |
gum::EdgeGraphPart::operator!=(const EdgeGraphPart &p) const | gum::EdgeGraphPart | |
operator=(const CliqueGraph &from) | gum::CliqueGraph | |
gum::UndiGraph::operator=(const UndiGraph &g) | gum::UndiGraph | |
gum::NodeGraphPart::operator=(const NodeGraphPart &p) | gum::NodeGraphPart | |
gum::EdgeGraphPart::operator=(const EdgeGraphPart &s) | gum::EdgeGraphPart | |
operator==(const CliqueGraph &from) const | gum::CliqueGraph | |
gum::UndiGraph::operator==(const UndiGraph &g) const | gum::UndiGraph | |
gum::NodeGraphPart::operator==(const NodeGraphPart &p) const | gum::NodeGraphPart | |
gum::EdgeGraphPart::operator==(const EdgeGraphPart &p) const | gum::EdgeGraphPart | |
partialUndiGraph(NodeSet nodes) | gum::UndiGraph | virtual |
populateNodes(const NodeGraphPart &s) | gum::NodeGraphPart | |
populateNodesFromProperty(const NodeProperty< T > &h) | gum::NodeGraphPart | |
separator(const Edge &edge) const | gum::CliqueGraph | |
separator(const NodeId clique1, const NodeId clique) const | gum::CliqueGraph | |
setClique(const NodeId idClique, const NodeSet &new_clique) | gum::CliqueGraph | virtual |
size() const | gum::NodeGraphPart | |
sizeEdges() const | gum::EdgeGraphPart | |
sizeNodes() const | gum::NodeGraphPart | |
toDot() const | gum::CliqueGraph | virtual |
toString() const | gum::CliqueGraph | virtual |
UndiGraph(Size nodes_size=HashTableConst::default_size, bool nodes_resize_policy=true, Size edges_size=HashTableConst::default_size, bool edges_resize_policy=true) | gum::UndiGraph | explicit |
UndiGraph(const UndiGraph &g) | gum::UndiGraph | |
undirectedPath(const NodeId node1, const NodeId node2) const | gum::EdgeGraphPart | |
unvirtualizedEraseNeighbours(const NodeId id) | gum::EdgeGraphPart | |
~CliqueGraph() | gum::CliqueGraph | virtual |
~EdgeGraphPart() | gum::EdgeGraphPart | virtual |
~NodeGraphPart() | gum::NodeGraphPart | virtual |
~UndiGraph() | gum::UndiGraph | virtual |