|
|||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | ||||||||||
| Interface Summary | |
|---|---|
| BitSetMapping | An object that implements a bijection between whole numbers and objects. |
| Graph | An abstract interface for generic graphs; general graph utilities should be defined in terms of this interface and all graph implementations in the system should implement it. |
| GraphEdge | Graph representations that use explicit edge objects should have their edge objects implement this interface. |
| GraphEdgeFilter | |
| GraphElement | Deprecated. |
| GraphNode | A generic interface for graph nodes. |
| SpaceEffGraphNode.GraphEdgeEnumeration<T extends GraphEdge> | |
| TopSortInterface | Interface to allow building top-sort, by calling TopSort.buildTopSort() |
| Class Summary | |
|---|---|
| Bits | Utilities for manipulating values at the bit-level. |
| BitSet | A bit set is a set of elements, each of which corresponds to a unique integer from [0,MAX]. |
| CompoundEnumerator<T> | |
| DepthFirstEnumerator | |
| DFSenumerateByFinish | This class implements depth-first search over a Graph, return an enumeration of the nodes of the graph in order of increasing finishing time. |
| FilteredDFSenumerateByFinish | |
| FilterEnumerator<S,T> | A FilterEnumerator filters and maps a source
Enumeration to generate a new one. |
| FilterEnumerator.Filter<S,T> | |
| FilterIterator<T> | A FilterIterator filters and maps a source
Iterator to generate a new one. |
| FilterIterator.Filter<T> | |
| GraphNodeEnumerator | |
| GraphNodeEnumerator.Enum | |
| GraphNodeEnumerator.Iter | |
| GraphUtilities | This class implements miscellaneous utilities for graphs. |
| Queue<T> | |
| ReverseDFSenumerateByFinish | This class generates an enumeration of nodes of a graph, in order of increasing finishing time in a reverse Depth First Search, i.e. a search traversing nodes from target to source. |
| ReverseEnumerator<T> | An enumerator that provides access to the reverse order of elements for
a given Enumeration. |
| ReverseFilteredDFSenumerateByFinish | |
| SortedGraphIterator | An efficient topsort dataflow iterator to be used with SortedGraphNode. |
| SortedGraphNode | |
| SpaceEffGraph | SpaceEffGraph package implements a generic directed graph that can be a multigraph. |
| SpaceEffGraph.NodeEnumeration | |
| SpaceEffGraphEdge | SpaceEffGraphEdge is a generic graph edge. |
| SpaceEffGraphEdgeList | |
| SpaceEffGraphNode | SpaceEffGraphNode is a generic graph node. |
| SpaceEffGraphNode.InEdgeEnumeration | |
| SpaceEffGraphNode.InNodeEnumeration | |
| SpaceEffGraphNode.OutEdgeEnumeration | |
| SpaceEffGraphNode.OutNodeEnumeration | |
| SpaceEffGraphNodeList | List of Graph nodes. |
| SpaceEffGraphNodeListHeader | |
| Stack<T> | Stack is a smaller implementation of java.util.Stack, that uses a linked list rather than a vector. |
| TopSort | Depth First Spanning Tree, builds topological sort of a graph consisting of SortedGraphNode. |
| Tree | This class is a generic tree. |
| TreeBottomUpEnumerator | This class provides enumeration of a tree in bottom-up order It guarantees that all children of a node will be visited before the parent. |
| TreeNode | This class is a node in a tree. |
| TreeNodeChildrenEnumerator | This class provides enumeration of all children of a TreeNode |
| TreeTopDownEnumerator | This class provides enumeration of elements of a tree in a town-down manner It guarantees that all children of a node will only be visited after the parent. |
|
|||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | ||||||||||