| _addHole_(NodeId id) | gum::NodeGraphPart | private |
| _arcs_ | gum::ArcGraphPart | private |
| _boundVal_ | gum::NodeGraphPart | private |
| _checkChildren_(NodeId id) | gum::ArcGraphPart | private |
| _checkParents_(NodeId id) | gum::ArcGraphPart | private |
| _children_ | gum::ArcGraphPart | private |
| _clearNodes_() | gum::NodeGraphPart | 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 |
| _parents_ | gum::ArcGraphPart | private |
| _sizeHoles_() const | gum::NodeGraphPart | private |
| _updateEndIteratorSafe_() | gum::NodeGraphPart | private |
| addArc(const NodeId tail, const NodeId head) | gum::DiGraph | virtual |
| addNode() | gum::NodeGraphPart | virtual |
| addNodes(Size n) | gum::NodeGraphPart | |
| addNodeWithId(const NodeId id) | gum::NodeGraphPart | virtual |
| ancestors(NodeId id) const | gum::ArcGraphPart | |
| ArcGraphPart(Size arcs_size=HashTableConst::default_size, bool arcs_resize_policy=true) | gum::ArcGraphPart | explicit |
| ArcGraphPart(const ArcGraphPart &s) | gum::ArcGraphPart | |
| ArcIterator typedef | gum::ArcGraphPart | |
| arcs() const | gum::ArcGraphPart | |
| arcsProperty(VAL(*f)(const Arc &), Size size=0) const | gum::ArcGraphPart | |
| arcsProperty(const VAL &a, Size size=0) const | gum::ArcGraphPart | |
| asNodeSet() const | gum::NodeGraphPart | |
| begin() const noexcept | gum::NodeGraphPart | |
| beginSafe() const | gum::NodeGraphPart | |
| bound() const | gum::NodeGraphPart | |
| children(const NodeSet &ids) const | gum::ArcGraphPart | |
| children(NodeId id) const | gum::ArcGraphPart | |
| clear() | gum::DiGraph | virtual |
| clearArcs() | gum::ArcGraphPart | |
| clearNodes() | gum::NodeGraphPart | virtual |
| completeGraph(int n) | gum::DiGraph | static |
| descendants(NodeId id) const | gum::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::DiGraph | explicit |
| DiGraph(const DiGraph &g) | gum::DiGraph | |
| directedPath(NodeId node1, NodeId node2) const | gum::ArcGraphPart | |
| directedUnorientedPath(NodeId node1, NodeId node2) const | gum::ArcGraphPart | |
| empty() const | gum::NodeGraphPart | |
| emptyArcs() const | gum::ArcGraphPart | |
| emptyNodes() const | gum::NodeGraphPart | |
| end() const noexcept | gum::NodeGraphPart | |
| endSafe() const noexcept | gum::NodeGraphPart | |
| eraseArc(const Arc &arc) | gum::ArcGraphPart | virtual |
| eraseChildren(NodeId id) | gum::ArcGraphPart | |
| eraseNode(const NodeId id) | gum::DiGraph | virtual |
| eraseParents(NodeId id) | gum::ArcGraphPart | |
| eraseSetOfArcs_(const ArcSet &set) | gum::ArcGraphPart | protected |
| exists(const NodeId id) const | gum::NodeGraphPart | |
| existsArc(const Arc &arc) const | gum::ArcGraphPart | |
| existsArc(NodeId tail, NodeId head) const | gum::ArcGraphPart | |
| existsNode(const NodeId id) const | gum::NodeGraphPart | |
| family(NodeId id) const | gum::ArcGraphPart | |
| family(const NodeSet &ids) const | gum::ArcGraphPart | |
| hasDirectedPath(NodeId from, NodeId to) | gum::DiGraph | |
| listMapArcs(VAL(*f)(const Arc &)) const | gum::ArcGraphPart | |
| listMapNodes(VAL(*f)(const NodeId &)) const | gum::NodeGraphPart | |
| 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 | |
| nodesPropertyFromFunction(VAL(*f)(const NodeId &), Size size=0) const | gum::NodeGraphPart | |
| nodesPropertyFromVal(const VAL &a, Size size=0) const | gum::NodeGraphPart | |
| onArcAdded | gum::ArcGraphPart | |
| onArcDeleted | gum::ArcGraphPart | |
| onNodeAdded | gum::NodeGraphPart | |
| onNodeDeleted | gum::NodeGraphPart | |
| operator!=(const NodeGraphPart &p) const | gum::NodeGraphPart | |
| operator=(const DiGraph &g) | gum::DiGraph | |
| gum::NodeGraphPart::operator=(const NodeGraphPart &p) | gum::NodeGraphPart | |
| gum::ArcGraphPart::operator=(const ArcGraphPart &s) | gum::ArcGraphPart | |
| operator==(const DiGraph &g) const | gum::DiGraph | |
| gum::NodeGraphPart::operator==(const NodeGraphPart &p) const | gum::NodeGraphPart | |
| gum::ArcGraphPart::operator==(const ArcGraphPart &p) const | gum::ArcGraphPart | |
| parents(NodeId id) const | gum::ArcGraphPart | |
| parents(const NodeSet &ids) const | gum::ArcGraphPart | |
| populateNodes(const NodeGraphPart &s) | gum::NodeGraphPart | |
| populateNodesFromProperty(const NodeProperty< T > &h) | gum::NodeGraphPart | |
| size() const | gum::NodeGraphPart | |
| sizeArcs() const | gum::ArcGraphPart | |
| sizeNodes() const | gum::NodeGraphPart | |
| toDot() const | gum::DiGraph | virtual |
| topologicalOrder() const | gum::DiGraph | |
| toString() const | gum::DiGraph | virtual |
| unvirtualizedEraseChildren(NodeId id) | gum::ArcGraphPart | |
| unvirtualizedEraseParents(NodeId id) | gum::ArcGraphPart | |
| unvirtualizedEraseSetOfArcs_(const ArcSet &set) | gum::ArcGraphPart | protected |
| ~ArcGraphPart() | gum::ArcGraphPart | virtual |
| ~DiGraph() | gum::DiGraph | virtual |
| ~NodeGraphPart() | gum::NodeGraphPart | virtual |
