|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||
See:
Description
| Class Summary | |
|---|---|
| AbstractBaseGraph<N,E extends Edge<N>> | Abstract base implementation for directed graphs. |
| AbstractBaseListenableGraph<N,E extends Edge<N>> | Super class for all directed graphs that support listeners on structural change events. |
| AbstractGraph<N,E> | Abstract superclass for all graphs, implementing base functionality common to all graphs. |
| BasePath<N,E extends Edge<N>> | Class realizing a path in a directed graph. |
| DefaultEdge<N> | Simple realization of a directed edge. |
| DefaultEdgeFactory<N> | Edge factory implementation creating instances of DefaultEdge. |
| DefaultGraph<N> | Simple realization of a directed graph. |
| FastUncheckedGraph<N,E extends Edge<N>> | Implements a graph as incidence map. |
| FastUncheckedPath<N,E extends Edge<N>> | Implements a path. |
| Subgraph<N,E extends Edge<N>> | Class realizing a subgraph of a directed graph. |
| TransposeGraph<N,E extends Edge<N>> | In the mathematical and algorithmic study of graph theory, the converse, transpose or reverse of a directed graph G is another directed graph on the same set of vertices with all of the edges reversed compared to the orientation of the corresponding edges in G. |
This package contains the base implementations of the graph and edge interface.
Graph,
Edge
|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||