Uses of Package
jcommon.graph

Packages that use jcommon.graph

jcommon.graph	Contains the standard API for interfacing with the jcommon-graph library.
jcommon.graph.impl	Contains implementations for key portions of the API.

Classes in jcommon.graph used by jcommon.graph

CyclicGraphException
Exception thrown when a cycle has been detected during a topological sort.

DirectedAcyclicGraph
Factory and implementation of a dependency graph that can topologically sort its vertices.

IAdjacencyList
An adjacency list is essentially an array of size n where A[i] is the list of out-neighbors of node i.

IAdjacencyListPair
Maintains a reference between a IVertex (IAdjacencyListPair.getVertex()) and its out-neighbors (IAdjacencyListPair.getOutNeighbors()).

IEdge
Represents a connection between two instances of IVertex of type TVertex.

IGraph
This is a simple graph holding IVertex vertices and IEdge edges connecting them.

ITopologicalSortAsyncResult
Returned by an asynchronous sort call.

ITopologicalSortCallback
A callback for when a vertex has been found in topological order.

ITopologicalSortCoordinator
Provides a means for communication with the asynchronous sorting driver (which is typically done by an instance of ITopologicalSortStrategy).

ITopologicalSortErrorCallback
A callback for when an error has occurred during asynchronous processing.

ITopologicalSortInput
Aggregates the output of out neighbor vertices as input to a vertex being processed.

ITopologicalSortStrategy
Provides a strategy for implementing a topological sort of an IGraph.

IVertex
Marker interface that designates an object as something that can be reasoned about in an IGraph instance.

NumberGraph
Factory and implementation of a dependency graph that can topologically sort vertices that are Numbers.

ObjectGraph
Factory and implementation of a dependency graph that can topologically sort vertices that are Objects.

StringGraph
Factory and implementation of a dependency graph that can topologically sort vertices that are Strings.

Classes in jcommon.graph used by jcommon.graph.impl

CyclicGraphException
Exception thrown when a cycle has been detected during a topological sort.

IAdjacencyList
An adjacency list is essentially an array of size n where A[i] is the list of out-neighbors of node i.

IAdjacencyListPair
Maintains a reference between a IVertex (IAdjacencyListPair.getVertex()) and its out-neighbors (IAdjacencyListPair.getOutNeighbors()).

IEdge
Represents a connection between two instances of IVertex of type TVertex.

ITopologicalSortAsyncResult
Returned by an asynchronous sort call.

ITopologicalSortCallback
A callback for when a vertex has been found in topological order.

ITopologicalSortErrorCallback
A callback for when an error has occurred during asynchronous processing.

ITopologicalSortInput
Aggregates the output of out neighbor vertices as input to a vertex being processed.

ITopologicalSortStrategy
Provides a strategy for implementing a topological sort of an IGraph.

IVertex
Marker interface that designates an object as something that can be reasoned about in an IGraph instance.

Pair
Associates two values together.