| abstractions | graphAbstraction | [protected] |
| addEdge(edge *e, unsigned int absLevel)=0 | graphAbstraction | [pure virtual] |
| addNode(node *n)=0 | graphAbstraction | [pure virtual] |
| clearMarkedNodes() | graphAbstraction | |
| computeWidth(node *n) | graphAbstraction | [private] |
| countEdgesAtDistance(node *child, node *parent, std::vector< int > &dists) | graphAbstraction | [private] |
| distance(path *p) | graphAbstraction | |
| getAbstractGraph(int level) | graphAbstraction | [inline] |
| getAbstractGraph(node *which) | graphAbstraction | [inline] |
| getAbstractionLevel(node *which) | graphAbstraction | [inline] |
| getNthChild(node *which, int n) | graphAbstraction | [inline] |
| getNthParent(node *which, int n) | graphAbstraction | |
| getNumAbstractGraphs() | graphAbstraction | [inline] |
| getNumChildren(node *which) | graphAbstraction | [inline] |
| getNumExternalEdges(node *n, node *p) | graphAbstraction | [private] |
| getParent(node *which) | graphAbstraction | [inline] |
| getParentHierarchy(node *from, node *to, std::vector< node * > &fromChain, std::vector< node * > &toChain) | graphAbstraction | |
| graphAbstraction() | graphAbstraction | [inline] |
| h(node *a, node *b)=0 | graphAbstraction | [pure virtual] |
| measureAbstractionValues(int level, double &n, double &n_dev, double &c, double &c_dev) | graphAbstraction | |
| measureAverageNodeWidth(int level) | graphAbstraction | |
| measureExpectedNodeWidth(node *n) | graphAbstraction | [private] |
| measureRepairHits() | graphAbstraction | [inline, virtual] |
| pathable(node *from, node *to)=0 | graphAbstraction | [pure virtual] |
| removeEdge(edge *e, unsigned int absLevel)=0 | graphAbstraction | [pure virtual] |
| removeNode(node *n)=0 | graphAbstraction | [pure virtual] |
| repairAbstraction()=0 | graphAbstraction | [pure virtual] |
| verifyHierarchy()=0 | graphAbstraction | [pure virtual] |
| widthBFS(node *child, node *parent) | graphAbstraction | [private] |
| ~graphAbstraction() | graphAbstraction | [virtual] |
