Uses of Interface
goldman.graph.WeightedEdge

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

Uses of WeightedEdge in goldman.graph
 

Classes in goldman.graph with type parameters of type WeightedEdge
 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 ShortestPathMatrix<V,E extends WeightedEdge<V>>
          The ShortestPathMatrix class is used to store the result from an all-pairs shortest path algorithm.
 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.
 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 WeightedEdge
 class SimpleWeightedEdge<V>
          The simple weighted edge class provides a sample implementation for a weighted edge.