goldman.graph
Class AdjacencyList<V,E extends Edge<V>>

java.lang.Object
  extended by goldman.graph.AbstractGraph<V,E>
      extended by goldman.graph.AdjacencyList<V,E>
All Implemented Interfaces:
Graph<V,E>, Iterable<V>

public class AdjacencyList<V,E extends Edge<V>>
extends AbstractGraph<V,E>

The AdjacencyList class provides an implementation for the adjacency list representation of a graph. This class just contains two constructors that wrap the AdjacencyListRepresentation class.


Field Summary
 
Fields inherited from class goldman.graph.AbstractGraph
INF
 
Constructor Summary
AdjacencyList()
           
AdjacencyList(boolean directed, boolean containsMultiEdges, boolean storeIncomingEdges)
           
 
Method Summary
 
Methods inherited from class goldman.graph.AbstractGraph
addEdge, addVertex, allowsMultiEdges, containsEdge, containsVertex, edgesFrom, edgesTo, getConnectedComponents, getCycle, getEdge, getStronglyConnectedComponents, hasCycle, isDirected, iterator, numConnectedComponents, numStronglyConnectedComponents, numVertices, removeEdge, removeVertex, topologicalOrder, toString, unweightedShortestPaths
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
 

Constructor Detail

AdjacencyList

public AdjacencyList(boolean directed,
                     boolean containsMultiEdges,
                     boolean storeIncomingEdges)

AdjacencyList

public AdjacencyList()