Uses of Interface
jcommon.graph.ITopologicalSortStrategy

Packages that use ITopologicalSortStrategy

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

Uses of ITopologicalSortStrategy in jcommon.graph

Methods in jcommon.graph with parameters of type ITopologicalSortStrategy

List<TVertex>	IGraph.sort(ITopologicalSortStrategy<TVertex> strategy) Provides a topologically sorted list of IVertex vertices.
List<TVertex>	DirectedAcyclicGraph.sort(ITopologicalSortStrategy<TVertex> strategy)
ITopologicalSortAsyncResult	IGraph.sortAsync(ExecutorService executor, ITopologicalSortStrategy<TVertex> strategy, ITopologicalSortCallback<TVertex> callback) Allows you to asynchronously and in-parallel process the vertices of a graph topologically.
ITopologicalSortAsyncResult	DirectedAcyclicGraph.sortAsync(ExecutorService executor, ITopologicalSortStrategy<TVertex> strategy, ITopologicalSortCallback<TVertex> callback)
ITopologicalSortAsyncResult	IGraph.sortAsync(ExecutorService executor, ITopologicalSortStrategy<TVertex> strategy, ITopologicalSortCallback<TVertex> callback, ITopologicalSortErrorCallback<TVertex> errorCallback) Allows you to asynchronously and in-parallel process the vertices of a graph topologically.
ITopologicalSortAsyncResult	DirectedAcyclicGraph.sortAsync(ExecutorService executor, ITopologicalSortStrategy<TVertex> strategy, ITopologicalSortCallback<TVertex> callback, ITopologicalSortErrorCallback<TVertex> errorCallback)
ITopologicalSortAsyncResult	IGraph.sortAsync(ITopologicalSortStrategy<TVertex> strategy, ITopologicalSortCallback<TVertex> callback) Allows you to asynchronously and in-parallel process the vertices of a graph topologically.
ITopologicalSortAsyncResult	DirectedAcyclicGraph.sortAsync(ITopologicalSortStrategy<TVertex> strategy, ITopologicalSortCallback<TVertex> callback)
ITopologicalSortAsyncResult	IGraph.sortAsync(ITopologicalSortStrategy<TVertex> strategy, ITopologicalSortCallback<TVertex> callback, ITopologicalSortErrorCallback<TVertex> errorCallback) Allows you to asynchronously and in-parallel process the vertices of a graph topologically.
ITopologicalSortAsyncResult	DirectedAcyclicGraph.sortAsync(ITopologicalSortStrategy<TVertex> strategy, ITopologicalSortCallback<TVertex> callback, ITopologicalSortErrorCallback<TVertex> errorCallback)

Uses of ITopologicalSortStrategy in jcommon.graph.impl

Classes in jcommon.graph.impl that implement ITopologicalSortStrategy

class

SimpleTopologicalSort<TVertex extends IVertex> Please see the following for a description of this algorithm: http://www.cs.washington.edu/education/courses/cse373/02sp/lectures/cse373-21-TopoSort-4up.pdf