Uses of Interface
goldman.graph.Graph

Packages that use Graph
goldman.graph A graph represents general relationships between pairs of elements from among a set of elements. 
 

Uses of Graph in goldman.graph
 

Subinterfaces of Graph in goldman.graph
 interface WeightedGraph<V,E extends WeightedEdge<V>>
          The weighted graph algorithms we present do not depend on a particular graph implementation.
 

Classes in goldman.graph that implement Graph
 class AbstractGraph<V,E extends Edge<V>>
          The AbstractGraph class embodies algorithms that perform computations on a graph in terms of the Graph interface.
 class AbstractWeightedGraph<V,E extends WeightedEdge<V>>
          The AbstractWeightedGraph class embodies algorithms that perform computations on a weighted graph in terms of the WeightedGraph interface.
 class AbstractWeightedGraph.FlowGraph
           
 class AdjacencyList<V,E extends Edge<V>>
          The AdjacencyList class provides an implementation for the adjacency list representation of a graph.
 class AdjacencyMatrix<V,E extends Edge<V>>
          The AdjacencyMatrix class provides an implementation for the adjacency matrix representation of a graph.
 class WeightedAdjacencyList<V,E extends WeightedEdge<V>>
          The WeightedAdjacencyList class provides an implementation for a weighted adjacency list.
 class WeightedAdjacencyMatrix<V,E extends WeightedEdge<V>>
          The WeightedAdjacencyMatrix class provides an implementation for a weighted adjacency matrix.