| Interfaces | |
|---|---|
| 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 | No description provided. |
| GraphElement | Many clients of graph methods expect their graph nodes to implement a pair of scratch fields, one of int type and one of object type. |
| GraphNode | A generic interface for graph nodes. |
| GraphNodeEnumeration | Generic interface for enumerations of graph nodes. |
| SpaceEffGraphNode.GraphEdgeEnumeration<T extends GraphEdge> | No description provided. |
| TopSortInterface | Interface to allow building top-sort, by calling TopSort.buildTopSort() 5/25/1999 |
| Classes | |
|---|---|
| Bits | Bits.java utilities for manipulating values at the bit-level. |
| BitSet | BitSet.java A bit set is a set of elements, each of which corresponds to a unique integer from [0,MAX]. |
| CompoundEnumerator<T> | No description provided. |
| DepthFirstEnumerator | No description provided. |
| 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. |
| EmptyEnumerator | Enumeration that doesn't have any elements. |
| EmptyIterator | No description provided. |
| FilteredDFSenumerateByFinish | No description provided. |
| FilterEnumerator<S, T> | A FilterEnumerator filters and maps a source
Enumeration to generate a new one. |
| FilterEnumerator.Filter<S, T> | No description provided. |
| FilterIterator<T> | A FilterIterator filters and maps a source
Iterator to generate a new one. |
| FilterIterator.Filter<T> | No description provided. |
| GraphNodeEnumerator | No description provided. |
| GraphNodeEnumerator.Enum | No description provided. |
| GraphNodeEnumerator.Iter | No description provided. |
| GraphUtilities | This class implements miscellaneous utilities for graphs. |
| Pair | No description provided. |
| Queue<T> | No description provided. |
| 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> | No description provided. |
| ReverseFilteredDFSenumerateByFinish | No description provided. |
| SortedGraphIterator | An efficient topsort dataflow iterator to be used with SortedGraphNode. |
| SortedGraphNode | No description provided. |
| SpaceEffGraph | SpaceEffGraph package implements a generic directed graph that can be a multigraph. |
| SpaceEffGraph.NodeEnumeration | No description provided. |
| SpaceEffGraphEdge | SpaceEffGraphEdge is a generic graph edge. |
| SpaceEffGraphEdgeList | No description provided. |
| SpaceEffGraphEdgeListHeader | No description provided. |
| SpaceEffGraphNode | SpaceEffGraphNode is a generic graph node. |
| SpaceEffGraphNode.InEdgeEnumeration | No description provided. |
| SpaceEffGraphNode.InNodeEnumeration | No description provided. |
| SpaceEffGraphNode.OutEdgeEnumeration | No description provided. |
| SpaceEffGraphNode.OutNodeEnumeration | No description provided. |
| SpaceEffGraphNodeList | List of Graph nodes. |
| SpaceEffGraphNodeListHeader | No description provided. |
| Stack<T> | Stack Stack is a smaller implementation of java.util.Stack, that uses a linked list rather than a vector. |
| TopSort | Depth First Spanning Tree March 14, 1998 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. |
