| _arc_map_ | gum::prm::gspan::Pattern | private |
| _code_ | gum::prm::gspan::Pattern | private |
| _expandCodeIsMinimal_(NodeId u, NodeId v) | gum::prm::gspan::Pattern | private |
| _last_ | gum::prm::gspan::Pattern | private |
| _node_map_ | gum::prm::gspan::Pattern | private |
| _not_rec_(Pattern &p, Bijection< NodeId, NodeId > &node_map, NodeId u, NodeId v) | gum::prm::gspan::Pattern | private |
| _rec_(Pattern &p, Bijection< NodeId, NodeId > &node_map, NodeId u, NodeId v) | gum::prm::gspan::Pattern | private |
| addArc(NodeId i, NodeId j, LabelData &l) | gum::prm::gspan::Pattern | |
| gum::DiGraph::addArc(const NodeId tail, const NodeId head) | gum::DiGraph | privatevirtual |
| addNode() | gum::NodeGraphPart | privatevirtual |
| addNodes(Size n) | gum::NodeGraphPart | private |
| addNodeWithId(const NodeId id) | gum::NodeGraphPart | privatevirtual |
| addNodeWithLabel(LabelData &l) | gum::prm::gspan::Pattern | |
| ancestors(NodeId id) const | gum::ArcGraphPart | private |
| ArcGraphPart(Size arcs_size=HashTableConst::default_size, bool arcs_resize_policy=true) | gum::ArcGraphPart | explicitprivate |
| ArcGraphPart(const ArcGraphPart &s) | gum::ArcGraphPart | private |
| ArcIterator typedef | gum::ArcGraphPart | private |
| arcs() const | gum::prm::gspan::Pattern | |
| arcsProperty(VAL(*f)(const Arc &), Size size=0) const | gum::ArcGraphPart | private |
| arcsProperty(const VAL &a, Size size=0) const | gum::ArcGraphPart | private |
| asNodeSet() const | gum::NodeGraphPart | private |
| begin() const noexcept | gum::NodeGraphPart | private |
| beginSafe() const | gum::NodeGraphPart | private |
| bound() const | gum::NodeGraphPart | private |
| children(const NodeSet &ids) const | gum::ArcGraphPart | private |
| children(NodeId id) const | gum::ArcGraphPart | private |
| clear() | gum::DiGraph | privatevirtual |
| clearArcs() | gum::ArcGraphPart | private |
| clearNodes() | gum::NodeGraphPart | privatevirtual |
| code() | gum::prm::gspan::Pattern | |
| code() const | gum::prm::gspan::Pattern | |
| descendants(NodeId id) const | gum::ArcGraphPart | private |
| 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 | explicitprivate |
| DiGraph(const DiGraph &g) | gum::DiGraph | private |
| directedPath(NodeId node1, NodeId node2) const | gum::ArcGraphPart | private |
| directedUnorientedPath(NodeId node1, NodeId node2) const | gum::ArcGraphPart | private |
| edgeCode(NodeId tail, NodeId head) | gum::prm::gspan::Pattern | |
| edgeCode(const Arc &arc) | gum::prm::gspan::Pattern | |
| edgeCode(NodeId tail, NodeId head) const | gum::prm::gspan::Pattern | |
| edgeCode(const Arc &arc) const | gum::prm::gspan::Pattern | |
| empty() const | gum::NodeGraphPart | private |
| emptyArcs() const | gum::ArcGraphPart | private |
| emptyNodes() const | gum::NodeGraphPart | private |
| end() const noexcept | gum::NodeGraphPart | private |
| endSafe() const noexcept | gum::NodeGraphPart | private |
| eraseArc(const Arc &arc) | gum::ArcGraphPart | privatevirtual |
| eraseChildren(NodeId id) | gum::ArcGraphPart | private |
| eraseNode(const NodeId id) | gum::DiGraph | privatevirtual |
| eraseParents(NodeId id) | gum::ArcGraphPart | private |
| eraseSetOfArcs_(const ArcSet &set) | gum::ArcGraphPart | private |
| exists(NodeId id) const | gum::prm::gspan::Pattern | |
| exists(NodeId tail, NodeId head) const | gum::prm::gspan::Pattern | |
| existsArc(const Arc &arc) const | gum::ArcGraphPart | private |
| existsArc(NodeId tail, NodeId head) const | gum::ArcGraphPart | private |
| existsNode(const NodeId id) const | gum::NodeGraphPart | private |
| family(NodeId id) const | gum::ArcGraphPart | private |
| family(const NodeSet &ids) const | gum::ArcGraphPart | private |
| hasDirectedPath(const NodeId from, const NodeId to) | gum::DiGraph | private |
| isMinimal() | gum::prm::gspan::Pattern | |
| label(NodeId node) | gum::prm::gspan::Pattern | |
| label(NodeId node) const | gum::prm::gspan::Pattern | |
| label(NodeId i, NodeId j) | gum::prm::gspan::Pattern | |
| label(NodeId i, NodeId j) const | gum::prm::gspan::Pattern | |
| label(const Arc &arc) | gum::prm::gspan::Pattern | |
| label(const Arc &arc) const | gum::prm::gspan::Pattern | |
| lastAdded() | gum::prm::gspan::Pattern | |
| lastAdded() const | gum::prm::gspan::Pattern | |
| listMapArcs(VAL(*f)(const Arc &)) const | gum::ArcGraphPart | private |
| listMapNodes(VAL(*f)(const NodeId &)) const | gum::NodeGraphPart | private |
| nextNodeId() const | gum::NodeGraphPart | private |
| node_const_iterator typedef | gum::NodeGraphPart | private |
| node_const_iterator_safe typedef | gum::NodeGraphPart | private |
| node_iterator typedef | gum::NodeGraphPart | private |
| node_iterator_safe typedef | gum::NodeGraphPart | private |
| NodeConstIterator typedef | gum::NodeGraphPart | private |
| NodeConstIteratorSafe typedef | gum::NodeGraphPart | private |
| NodeGraphPart(Size holes_size=HashTableConst::default_size, bool holes_resize_policy=true) | gum::NodeGraphPart | explicitprivate |
| NodeGraphPart(const NodeGraphPart &s) | gum::NodeGraphPart | private |
| NodeIterator typedef | gum::NodeGraphPart | private |
| NodeIteratorSafe typedef | gum::NodeGraphPart | private |
| nodes() const | gum::prm::gspan::Pattern | |
| nodesProperty(VAL(*f)(const NodeId &), Size size=0) const | gum::NodeGraphPart | private |
| nodesProperty(const VAL &a, Size size=0) const | gum::NodeGraphPart | private |
| onArcAdded | gum::ArcGraphPart | private |
| onArcDeleted | gum::ArcGraphPart | private |
| onNodeAdded | gum::NodeGraphPart | private |
| onNodeDeleted | gum::NodeGraphPart | private |
| operator!=(const DiGraph &g) const | gum::DiGraph | private |
| gum::NodeGraphPart::operator!=(const NodeGraphPart &p) const | gum::NodeGraphPart | private |
| gum::ArcGraphPart::operator!=(const ArcGraphPart &p) const | gum::ArcGraphPart | private |
| operator=(const DiGraph &g) | gum::DiGraph | private |
| gum::NodeGraphPart::operator=(const NodeGraphPart &p) | gum::NodeGraphPart | private |
| gum::ArcGraphPart::operator=(const ArcGraphPart &s) | gum::ArcGraphPart | private |
| operator==(const DiGraph &g) const | gum::DiGraph | private |
| gum::NodeGraphPart::operator==(const NodeGraphPart &p) const | gum::NodeGraphPart | private |
| gum::ArcGraphPart::operator==(const ArcGraphPart &p) const | gum::ArcGraphPart | private |
| parents(NodeId id) const | gum::ArcGraphPart | private |
| parents(const NodeSet &ids) const | gum::ArcGraphPart | private |
| Pattern() | gum::prm::gspan::Pattern | |
| Pattern(const Pattern &source) | gum::prm::gspan::Pattern | |
| pop_back() | gum::prm::gspan::Pattern | |
| populateNodes(const NodeGraphPart &s) | gum::NodeGraphPart | private |
| populateNodesFromProperty(const NodeProperty< T > &h) | gum::NodeGraphPart | private |
| remove(NodeId node) | gum::prm::gspan::Pattern | |
| rightmostPath(std::list< NodeId > &r_path) const | gum::prm::gspan::Pattern | |
| size() const | gum::prm::gspan::Pattern | |
| sizeArcs() const | gum::prm::gspan::Pattern | |
| sizeNodes() const | gum::NodeGraphPart | private |
| toDot(size_t name) const | gum::prm::gspan::Pattern | |
| gum::DiGraph::toDot() const | gum::DiGraph | privatevirtual |
| topologicalOrder(bool clear=true) const | gum::DiGraph | private |
| toString() const | gum::DiGraph | privatevirtual |
| unvirtualizedEraseChildren(NodeId id) | gum::ArcGraphPart | private |
| unvirtualizedEraseParents(NodeId id) | gum::ArcGraphPart | private |
| unvirtualizedEraseSetOfArcs_(const ArcSet &set) | gum::ArcGraphPart | private |
| ~ArcGraphPart() | gum::ArcGraphPart | privatevirtual |
| ~DiGraph() | gum::DiGraph | privatevirtual |
| ~NodeGraphPart() | gum::NodeGraphPart | privatevirtual |
| ~Pattern() | gum::prm::gspan::Pattern | |
