|
AbstractGraph
|
An abstract class containing methods common to all graphs.
|
|
DisjointSet
|
Contains methods for managing disjoint sets. Some graph methods depend on objects of this class.
|
|
Edge
|
Defines generic edges that can be used with all graphs.
|
|
LinkedListGraph
|
Uses a linked list representation of edges to describe directed or undirected graphs
with no edge weights. This class will generally
perform better than a MatrixGraph on sparse graphs.
|
|
MatrixGraph
|
Uses a matrix representation of edges to represent directed or undirected graphs
with no edge weights. This class will often provide superior performance on dense graphs.
|
|
WeightedEdge
|
Weighted edges for use in weighted graphs.
|
|
WeightedLinkedListGraph
|
Uses a linked list representation of edges to describe
directed or undirected graphs with weighted edges. Like LinkedListGraph,
it typically provides superior performance on sparse graphs.
|
|
WeightedMatrixGraph
|
Uses a matrix representation of edges to represent directed or undirected graphs
with weighted edges. This class will often provide superior performance on dense graphs.
|
|
WeightedVertex
|
Provides a representation for vertices with which we want to associate a real-valued weight.
|
