Package graph

Directed graphs and algorithms on them.

See:
Description

Interface Summary

Digraph	This is the simplest useful directed graph interface.
DirectedEdge	A directed edge.
KeyedDigraph	A Digraph with keyed vertices.
Vertex	A vertex in a graph.
Weighter	A class used to find the weight of objects, such as graph edges.

Class Summary

AdjListDigraph	A directed graph in which each vertex stores its outgoing edges.
Dijkstra	A class to find shortest paths from a single start point to any end point.
DirectedAdjListVertex	A vertex in an AdjListDigraph.
HashKeyedDigraph	An implementation of KeyedDigraph that wraps another Digraph (no matter what its implementation) and adds a hash table.
Path	A sequence of directed edges laid end to end.
StoredDirectedEdge	A straightforward implementation of the DirectedEdge interface.
StoredVertex	A straightforward implementation of the Vertex interface.

Exception Summary

NegativeWeightException	Runtime exception thrown when a method discovers a negative weight in a graph that wasn't supposed to have negative weights.
NoSuchVertexException	Runtime exception thrown when the user attempts to look up a vertex in a KeyedDigraph by a nonexistent key.

Package graph Description

Directed graphs and algorithms on them.