Uses of Interface
goldman.graph.Edge

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

Uses of Edge in goldman.graph
 

Classes in goldman.graph with type parameters of type Edge
 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 AdjacencyList<V,E extends Edge<V>>
          The AdjacencyList class provides an implementation for the adjacency list representation of a graph.
 class AdjacencyListRepresentation<V,E extends Edge<V>>
          The AdjacencyListRepresentation class implements 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 AdjacencyMatrixRepresentation<V,E extends Edge<V>>
          The AdjacencyMatrixRepresentation class implements the adjacency matrix representation of a graph.
 interface Graph<V,E extends Edge<V>>
          A graph represents general relationships between pairs of elements from among a set of elements.
 interface GraphRepresentation<V,E extends Edge<V>>
          The GraphRepresentation interface defines the methods that must be supported by any graph representation, such as the adjacency list and adjacency matrix representations.
 class InTree<V,E extends Edge<V>>
          The InTree class provides an implementation of an in-tree that stores a parent edge associated with each vertex of the graph (possibly null).
 

Subinterfaces of Edge in goldman.graph
 interface WeightedEdge<V>
          The WeightedEdge interface is used for a weighted edge.
 

Classes in goldman.graph that implement Edge
 class SimpleEdge<V>
          The SimpleEdge class provides a sample implementation for an edge.
 class SimpleWeightedEdge<V>
          The simple weighted edge class provides a sample implementation for a weighted edge.