| areSubtreesEqual(const Tree &t1, Node n1, const Tree &t2, Node n2) | Tree | [static] |
| assign(const int &x) | Graph< NodeWeight > | |
| assign(Node n, const NodeWeight &x) | Graph< NodeWeight > | |
| assign(Edge n, const int &x) | Graph< NodeWeight > | |
| copy(const Graph &g) | Graph< NodeWeight > | |
| deleteSubtreeCost(Node n) const | Tree | |
| distance(const Tree &t1, const Tree &t2) | Tree | [static] |
| edgeMap | Graph< NodeWeight > | [protected] |
| getEdgeMap() const | Graph< NodeWeight > | |
| getNode(int externalId) const | Tree | |
| getNodeInf(int externalId) const | Tree | |
| getNodeMap() const | Graph< NodeWeight > | |
| getRoot() const | Tree | |
| Graph() | Graph< NodeWeight > | |
| Graph(const Graph &g) | Graph< NodeWeight > | |
| Graph(const Graph &g, const list< Node > &listNode) | Graph< NodeWeight > | |
| inf() | Graph< NodeWeight > | |
| inf(Node n) | Graph< NodeWeight > | |
| inf(Node n) const | Graph< NodeWeight > | |
| inf(Edge n) | Graph< NodeWeight > | |
| inf(Edge n) const | Graph< NodeWeight > | |
| insertSubtreeCost(Node n) const | Tree | |
| insertSubtreeCost(Node n, double &cost) const | Tree | [private] |
| isTree() | Tree | |
| load_graph_info_handler(GML_pair *list_graph) | Tree | [protected, virtual] |
| load_node_info_handler(node n, GML_pair *list_node) | Tree | [protected, virtual] |
| newEdge(Node source, Node target, const int &x=0) | Graph< NodeWeight > | [virtual] |
| newNode(const NodeWeight &x) | Graph< NodeWeight > | [virtual] |
| nodeMap | Graph< NodeWeight > | [protected] |
| operator=(const Graph &g) | Graph< NodeWeight > | |
| operator==(const Tree &t) | Tree | |
| postOrder() | Tree | |
| postOrder(Node n, int &counter, bool makeKeyroot) | Tree | [private] |
| postOrderComplete() | Tree | |
| postOrderComplete(Node n, int &counter, bool makeKeyroot) | Tree | [private] |
| postOrderRay() | Tree | |
| postOrderRay(Node n, int &counter, bool makeKeyroot) | Tree | [private] |
| print(const Tree &t, ostream &os) | Tree | [static] |
| removeEdge(Edge e) | Graph< NodeWeight > | [virtual] |
| removeNode(Node n) | Graph< NodeWeight > | [virtual] |
| save_graph_info_handler(ostream *os) const | Tree | [protected, virtual] |
| save_node_info_handler(ostream *os, node n) const | Tree | [protected, virtual] |
| swapSubtrees(const Tree &t1, Node n11, Node n12, const Tree &t2, Node n21, Node n22) | Tree | [static] |
| tree | Tree | [private] |
| Tree() | Tree | |
| Tree(const Tree &t) | Tree | |
| ~Graph() | Graph< NodeWeight > | |
| ~Tree() | Tree | |
