| _addChild_(Pattern &p, Pattern *child, EdgeGrowth< GUM_SCALAR > &edge_growth) | gum::prm::gspan::DFSTree< GUM_SCALAR > | private |
| _arcs_ | gum::ArcGraphPart | private |
| _checkChildren_(NodeId id) | gum::ArcGraphPart | private |
| _checkGrowth_(Pattern &p, Pattern *child, EdgeGrowth< GUM_SCALAR > &edge_growth) | gum::prm::gspan::DFSTree< GUM_SCALAR > | private |
| _checkParents_(NodeId id) | gum::ArcGraphPart | private |
| _children_ | gum::ArcGraphPart | private |
| _data_ | gum::prm::gspan::DFSTree< GUM_SCALAR > | private |
| _graph_ | gum::prm::gspan::DFSTree< GUM_SCALAR > | private |
| _initialiaze_root_(Pattern *p, Sequence< EdgeData< GUM_SCALAR > * > &seq) | gum::prm::gspan::DFSTree< GUM_SCALAR > | private |
| _is_new_seq_(Sequence< PRMInstance< GUM_SCALAR > * > &seq, NodeProperty< Sequence< PRMInstance< GUM_SCALAR > * > * > &iso_map) | gum::prm::gspan::DFSTree< GUM_SCALAR > | private |
| _node_map_ | gum::prm::gspan::DFSTree< GUM_SCALAR > | private |
| _parents_ | gum::ArcGraphPart | private |
| _roots_ | gum::prm::gspan::DFSTree< GUM_SCALAR > | private |
| _strategy_ | gum::prm::gspan::DFSTree< GUM_SCALAR > | private |
| _test_equality_(HashTable< PRMClassElement< GUM_SCALAR > *, Size > &x, HashTable< PRMClassElement< GUM_SCALAR > *, Size > &y) | gum::prm::gspan::DFSTree< GUM_SCALAR > | private |
| addArc(const NodeId tail, const NodeId head) override | gum::DiGraph | privatevirtual |
| addNode() | gum::NodeGraphPart | privatevirtual |
| addNodes(Size n) | gum::NodeGraphPart | private |
| addNodeWithId(const NodeId id) | gum::NodeGraphPart | privatevirtual |
| addRoot(LabelData &data) | gum::prm::gspan::DFSTree< GUM_SCALAR > | |
| ancestors(NodeId id) const | gum::DiGraph | private |
| ArcGraphPart(Size arcs_size=HashTableConst::default_size, bool arcs_resize_policy=true) | gum::ArcGraphPart | explicitprivate |
| ArcGraphPart(const ArcGraphPart &s) | gum::ArcGraphPart | private |
| ArcGraphPart(ArcGraphPart &&s) | gum::ArcGraphPart | private |
| ArcIterator typedef | gum::ArcGraphPart | private |
| arcs() const | gum::ArcGraphPart | private |
| 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 Pattern &p) | gum::prm::gspan::DFSTree< GUM_SCALAR > | |
| children(const Pattern &p) const | gum::prm::gspan::DFSTree< GUM_SCALAR > | |
| gum::DiGraph::children(const NodeSet &ids) const | gum::ArcGraphPart | private |
| gum::DiGraph::children(NodeId id) const | gum::ArcGraphPart | private |
| clear() override | gum::DiGraph | privatevirtual |
| clearArcs() | gum::ArcGraphPart | private |
| clearNodes() | gum::NodeGraphPart | privatevirtual |
| completeGraph(int n) | gum::DiGraph | privatestatic |
| connectedComponents() const | gum::DiGraph | private |
| data(const Pattern &p) | gum::prm::gspan::DFSTree< GUM_SCALAR > | |
| data(const Pattern &p) const | gum::prm::gspan::DFSTree< GUM_SCALAR > | |
| descendants(NodeId id) const | gum::DiGraph | private |
| DFSTree(const InterfaceGraph< GUM_SCALAR > &graph, SearchStrategy< GUM_SCALAR > *strategy=0) | gum::prm::gspan::DFSTree< GUM_SCALAR > | |
| 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 |
| DiGraph(DiGraph &&g) | gum::DiGraph | private |
| directedPath(NodeId node1, NodeId node2) const | gum::DiGraph | private |
| directedUnorientedPath(NodeId node1, NodeId node2) const | gum::DiGraph | private |
| dotNodeLabel(NodeId id) const | gum::NodeGraphPart | private |
| 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) override | gum::DiGraph | privatevirtual |
| eraseParents(NodeId id) | gum::ArcGraphPart | private |
| eraseSetOfArcs_(const ArcSet &set) | gum::ArcGraphPart | private |
| exists(const NodeId id) const | gum::NodeGraphPart | private |
| 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::DiGraph | private |
| family(const NodeSet &ids) const | gum::DiGraph | private |
| frequency(const Pattern &p) const | gum::prm::gspan::DFSTree< GUM_SCALAR > | |
| growPattern(Pattern &p, EdgeGrowth< GUM_SCALAR > &edge_growth, Size min_freq) | gum::prm::gspan::DFSTree< GUM_SCALAR > | |
| hasDirectedPath(NodeId from, NodeId to) const | gum::DiGraph | private |
| hasName(NodeId id) const | gum::NodeGraphPart | private |
| idFromName(const std::string &name) const | gum::NodeGraphPart | private |
| internalGraph() const | gum::prm::gspan::DFSTree< GUM_SCALAR > | |
| iso_graph(const Pattern &p) | gum::prm::gspan::DFSTree< GUM_SCALAR > | |
| iso_map(const Pattern &p, NodeId node) | gum::prm::gspan::DFSTree< GUM_SCALAR > | |
| listMapArcs(VAL(*f)(const Arc &)) const | gum::ArcGraphPart | private |
| listMapNodes(VAL(*f)(const NodeId &)) const | gum::NodeGraphPart | private |
| max_indep_set(const Pattern &p) | gum::prm::gspan::DFSTree< GUM_SCALAR > | |
| nameFromId(NodeId id) 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 |
| gum::DiGraph::NodeGraphPart(const NodeGraphPart &s) | gum::NodeGraphPart | private |
| gum::DiGraph::NodeGraphPart(NodeGraphPart &&s) | gum::NodeGraphPart | private |
| NodeIterator typedef | gum::NodeGraphPart | private |
| NodeIteratorSafe typedef | gum::NodeGraphPart | private |
| nodes() const | gum::NodeGraphPart | private |
| nodesPropertyFromFunction(VAL(*f)(const NodeId &), Size size=0) const | gum::NodeGraphPart | private |
| nodesPropertyFromVal(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) | gum::DiGraph | private |
| operator=(DiGraph &&g) | gum::DiGraph | private |
| gum::ArcGraphPart::operator=(const ArcGraphPart &s) | gum::ArcGraphPart | private |
| gum::ArcGraphPart::operator=(ArcGraphPart &&s) | gum::ArcGraphPart | private |
| gum::NodeGraphPart::operator=(const NodeGraphPart &p) | gum::NodeGraphPart | private |
| gum::NodeGraphPart::operator=(NodeGraphPart &&p) | gum::NodeGraphPart | private |
| operator==(const DiGraph &g) const | gum::DiGraph | private |
| gum::ArcGraphPart::operator==(const ArcGraphPart &p) const | gum::ArcGraphPart | private |
| gum::NodeGraphPart::operator==(const NodeGraphPart &p) const | gum::NodeGraphPart | private |
| parent(const Pattern &p) | gum::prm::gspan::DFSTree< GUM_SCALAR > | |
| parent(const Pattern &p) const | gum::prm::gspan::DFSTree< GUM_SCALAR > | |
| parents(NodeId id) const | gum::ArcGraphPart | private |
| parents(const NodeSet &ids) const | gum::ArcGraphPart | private |
| pattern(NodeId id) | gum::prm::gspan::DFSTree< GUM_SCALAR > | |
| pattern(NodeId id) const | gum::prm::gspan::DFSTree< GUM_SCALAR > | |
| populateNodes(const NodeGraphPart &s) | gum::NodeGraphPart | private |
| populateNodesFromProperty(const NodeProperty< T > &h) | gum::NodeGraphPart | private |
| roots() | gum::prm::gspan::DFSTree< GUM_SCALAR > | |
| roots() const | gum::prm::gspan::DFSTree< GUM_SCALAR > | |
| setName(NodeId id, const std::string &name) | gum::NodeGraphPart | private |
| size() const | gum::NodeGraphPart | private |
| sizeArcs() const | gum::ArcGraphPart | private |
| sizeNodes() const | gum::NodeGraphPart | private |
| strategy() | gum::prm::gspan::DFSTree< GUM_SCALAR > | |
| strategy() const | gum::prm::gspan::DFSTree< GUM_SCALAR > | |
| toDot() const | gum::DiGraph | privatevirtual |
| topologicalOrder() const | gum::DiGraph | private |
| toString() const override | 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 |
| ~DFSTree() override | gum::prm::gspan::DFSTree< GUM_SCALAR > | |
| ~DiGraph() override | gum::DiGraph | private |
| ~NodeGraphPart() | gum::NodeGraphPart | privatevirtual |
