| Methods in jcommon.graph with parameters of type ITopologicalSortErrorCallback |
ITopologicalSortAsyncResult<TValue,TProcessedValue> |
ITopologicalSortStrategy.sortAsync(ExecutorService executor,
IAdjacencyList<TVertex,TValue,TProcessedValue> adjacencyList,
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(ExecutorService executor,
ITopologicalSortCallback<TValue,TProcessedValue> callback,
ITopologicalSortErrorCallback<TValue> errorCallback)
|
ITopologicalSortAsyncResult<TValue,TProcessedValue> |
IGraph.sortAsync(ExecutorService executor,
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(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(ITopologicalSortCallback<TValue,TProcessedValue> callback,
ITopologicalSortErrorCallback<TValue> errorCallback)
|
ITopologicalSortAsyncResult<TValue,TProcessedValue> |
IGraph.sortAsync(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,
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. |