|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use goldman.graph | |
---|---|
goldman.graph | A graph represents general relationships between pairs of elements from among a set of elements. |
Classes in goldman.graph used by goldman.graph | |
---|---|
AbstractGraph
The AbstractGraph class embodies algorithms that perform computations on a graph in terms of the Graph
interface. |
|
AbstractWeightedGraph
The AbstractWeightedGraph class embodies algorithms that perform computations on a weighted graph in terms of the WeightedGraph
interface. |
|
AbstractWeightedGraph.FlowGraph
|
|
DisconnectedGraphException
The DisconnectedGraphException is thrown when a graph algorithm that
should only be applied on a connected graph (e.g., a spanning tree algorithm) is
applied to a graph that is composed of more than one connected component. |
|
Edge
The Edge interface is used for an unweighted edge. |
|
Graph
A graph represents general relationships between pairs of elements from among a set of elements. |
|
GraphRepresentation
The GraphRepresentation interface
defines the methods that must be
supported by any graph representation,
such as the adjacency list and adjacency matrix representations. |
|
InTree
The InTree class provides an implementation of an in-tree that stores a parent edge associated with each vertex of the graph (possibly null). |
|
NegativeWeightEdgeException
The NegativeWeightEdgeException is thrown when a graph algorithm that
should only be applied on a weighted graph without any negative weight edges
(e.g., Dijkstra's single-source shortest path algorithm) whenever
a negative weight edge that is encountered. |
|
ShortestPathMatrix
The ShortestPathMatrix class is used to store the result from an all-pairs shortest path algorithm. |
|
SimpleEdge
The SimpleEdge class provides a sample implementation for an edge. |
|
WeightedAdjacencyMatrix
The WeightedAdjacencyMatrix class provides an implementation for a weighted adjacency matrix. |
|
WeightedEdge
The WeightedEdge interface is used for a weighted edge. |
|
WeightedGraph
The weighted graph algorithms we present do not depend on a particular graph implementation. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |