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

Uses of ITopologicalSortStrategy in jcommon.graph.impl

Classes in jcommon.graph.impl that implement ITopologicalSortStrategy

class

SimpleTopologicalSort<TVertex extends IVertex<TValue>,TValue,TProcessedValue> Implements ITopologicalSortStrategy for doing iterative and concurrent topological sorts.