Package jdsl.graph.ref

Package of implementations of the interfaces in jdsl.graph.api.   The IncidenceListGraph class provides a very general graph implementation.   The package also contains Iterator types VertexIterator and EdgeIterator for iterating over Vertex and Edge accessors. 

See:
          Description

Interface Summary
ToString.EdgeToString  
ToString.VertexToString  
 

Class Summary
AbstractGraph An implementation of many of the methods of InspectableGraph in terms of a few primitives.
AbstractGraph.OO_to_O_MergerIterator  
EdgeIteratorAdapter Takes an ObjectIterator known to be iterating over things that are edges, and makes it appear as an EdgeIterator.
IncidenceListGraph An implementation of the Graph interface, including self-loops, parallel edges, and mixed directed and undirected edges.
InspectableSubgraph This class represents a subgraph of an InspectableGraph.
ToString Class with static methods to generate a string representing a graph.
ToString.EdgeInRTStyle  
ToString.EdgeToEmptyString  
ToString.VertexToEmptyString  
ToString.VertexWritesElementOnly  
VertexIteratorAdapter Takes an ObjectIterator known to be iterating over things that are Vertices, and makes it appear as an VertexIterator.
 

Package jdsl.graph.ref Description

Package of implementations of the interfaces in jdsl.graph.api.   The IncidenceListGraph class provides a very general graph implementation.   The package also contains Iterator types VertexIterator and EdgeIterator for iterating over Vertex and Edge accessors.