| _addHole_(NodeId id) | gum::NodeGraphPart | private |
| _boundVal_ | gum::NodeGraphPart | private |
| _checkNeighbours_(NodeId id) | gum::EdgeGraphPart | private |
| _clearEdges_() | gum::EdgeGraphPart | private |
| _clearNodes_() | gum::NodeGraphPart | private |
| _edges_ | gum::EdgeGraphPart | private |
| _endIteratorSafe_ | gum::NodeGraphPart | private |
| _eraseHole_(NodeId id) | gum::NodeGraphPart | private |
| _holes_ | gum::NodeGraphPart | private |
| _holes_resize_policy_ | gum::NodeGraphPart | private |
| _holes_size_ | gum::NodeGraphPart | private |
| _inHoles_(NodeId id) const | gum::NodeGraphPart | private |
| _neighbours_ | gum::EdgeGraphPart | private |
| _sizeHoles_() const | gum::NodeGraphPart | private |
| _updateEndIteratorSafe_() | gum::NodeGraphPart | private |
| addEdge(NodeId first, NodeId second) override | gum::UndiGraph | virtual |
| addNode() | gum::NodeGraphPart | virtual |
| addNodes(Size n) | gum::NodeGraphPart | |
| addNodeWithId(const NodeId id) | gum::NodeGraphPart | virtual |
| asNodeSet() const | gum::NodeGraphPart | |
| begin() const noexcept | gum::NodeGraphPart | |
| beginSafe() const | gum::NodeGraphPart | |
| bound() const | gum::NodeGraphPart | |
| clear() override | gum::UndiGraph | virtual |
| clearEdges() | gum::EdgeGraphPart | virtual |
| clearNodes() | gum::NodeGraphPart | virtual |
| completeGraph(int n) | gum::UndiGraph | static |
| 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 &val, 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::EdgeGraphPart | virtual |
| eraseNeighbours(NodeId id) | gum::EdgeGraphPart | |
| eraseNode(NodeId id) override | gum::UndiGraph | virtual |
| exists(const NodeId id) const | gum::NodeGraphPart | |
| existsEdge(const Edge &edge) const | gum::EdgeGraphPart | |
| existsEdge(NodeId n1, NodeId n2) const | gum::EdgeGraphPart | |
| existsNode(const NodeId id) const | gum::NodeGraphPart | |
| hasUndirectedCycle() const | gum::UndiGraph | |
| hasUndirectedPath(NodeId n1, NodeId n2) const | gum::EdgeGraphPart | |
| hasUndirectedPath(NodeId n1, NodeId n2, const NodeSet &except) const | gum::EdgeGraphPart | |
| hasUndirectedPath(const NodeSet &n1, const NodeSet &n2, const NodeSet &except) const | gum::EdgeGraphPart | |
| listMapEdges(VAL(*f)(const Edge &)) const | gum::EdgeGraphPart | |
| listMapNodes(VAL(*f)(const NodeId &)) const | gum::NodeGraphPart | |
| neighbours(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 | |
| nodesPropertyFromFunction(VAL(*f)(const NodeId &), Size size=0) const | gum::NodeGraphPart | |
| nodesPropertyFromVal(const VAL &a, Size size=0) const | gum::NodeGraphPart | |
| onEdgeAdded | gum::EdgeGraphPart | |
| onEdgeDeleted | gum::EdgeGraphPart | |
| onNodeAdded | gum::NodeGraphPart | |
| onNodeDeleted | gum::NodeGraphPart | |
| operator!=(const UndiGraph &g) const | gum::UndiGraph | |
| gum::NodeGraphPart::operator!=(const NodeGraphPart &p) const | gum::NodeGraphPart | |
| operator=(const UndiGraph &g) | gum::UndiGraph | |
| gum::NodeGraphPart::operator=(const NodeGraphPart &p) | gum::NodeGraphPart | |
| gum::EdgeGraphPart::operator=(const EdgeGraphPart &s) | gum::EdgeGraphPart | |
| 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 | |
| size() const | gum::NodeGraphPart | |
| sizeEdges() const | gum::EdgeGraphPart | |
| sizeNodes() const | gum::NodeGraphPart | |
| toDot() const | gum::UndiGraph | virtual |
| toString() const override | gum::UndiGraph | 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(NodeId node1, NodeId node2) const | gum::EdgeGraphPart | |
| unvirtualizedEraseNeighbours(NodeId id) | gum::EdgeGraphPart | |
| ~EdgeGraphPart() | gum::EdgeGraphPart | virtual |
| ~NodeGraphPart() | gum::NodeGraphPart | virtual |
| ~UndiGraph() | gum::UndiGraph | virtual |
