|
|||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | ||||||||
See:
Description
| Interface Summary | |
|---|---|
| IGraph<Node> | Specification of an immutable, unlabeled, directed graph with useful operations on it. |
| IGraphEntityVisitor<Node> | Specification of a visitor over entities of a directed graph. |
| ILabeledGraph<Node,Label> | Specification of an immutable, labeled, directed graph with useful operations on it. |
| IMutableGraph<Node> | Specification of a mutable, unlabeled, directed graph with useful operations on it. |
| IMutableLabeledGraph<Node,Label> | Specification of a mutable, labeled, directed graph with useful operations on it. |
| IPathVisitor<Node> | Specification of a visitor over edges in a path of a directed graph. |
| Class Summary | |
|---|---|
| AbstractGraph<Node> | Partial implementation of a directed graph that provides various operations on the graph that are useful for program analysis (e.g., computing SCCs, ordering nodes in RPO, etc.) but leaves the representation of the graph itself unspecified. |
| AllPathsBuilder<Node> | Algorithm for computing all paths between a pair of nodes in a directed graph. |
| BackEdgesFinder<Node> | Algorithm for finding all back edges in a directed graph. |
| CycleFindingSCCVisitor<Node> | A visitor over the Strongly Connected Components (SCCs) of a directed graph that finds all nodes in cycles. |
| CycleTestingSCCVisitor<Node> | A visitor over the Strongly Connected Components (SCCs) of a directed graph that checks for cycles in the graph. |
| MutableGraph<Node> | Complete implementation of a mutable, unlabeled, directed graph with useful operations on it. |
| MutableLabeledGraph<Node,Label> | Complete implementation of a mutable, labeled, directed graph with useful operations on it. |
| RPOBuilder<Node> | Algorithm for computing the Reverse Post Order (RPO) of the nodes in a directed graph. |
| SCCBuilder<Node> | Algorithm for computing the Strongly Connected Components (SCCs) of a directed graph. |
| SCCFindingVisitor<Node> | A visitor over the Strongly Connected Components (SCCs) of a directed graph. |
| ShortestPathBuilder<Node> | Algorithm for computing the shortest path between a pair of nodes in a directed graph. |
| SimpleCyclesFinder<Node> | Algorithm for finding all simple cycles in a directed graph. |
| Exception Summary | |
|---|---|
| GraphEntityVisitorException | Exception that may be thrown by a client of
IGraphEntityVisitor to terminate the visitor's traversal. |
Graph utilities.
|
|||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | ||||||||