Class DeltaSteppingShortestPath.MaxEdgeWeightTask

java.lang.Object

java.util.concurrent.ForkJoinTask<Double>

java.util.concurrent.RecursiveTask<Double>

org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath.MaxEdgeWeightTask

All Implemented Interfaces:

Serializable, Future<Double>

Enclosing class:

DeltaSteppingShortestPath<V,E>

class DeltaSteppingShortestPath.MaxEdgeWeightTask
extends RecursiveTask<Double>

Is used during the algorithm to compute maximum edge weight of the BaseShortestPathAlgorithm.graph. Apart from computing the maximal edge weight in the graph the task also checks if there exist edges with negative weights.

Since:

January 2018

Nested Class Summary

Nested classes/interfaces inherited from interface Future

Future.State

Field Summary

Fields

Modifier and Type	Field	Description
(package private) long	loadBalancing	Amount of edges which are processed in parallel.
(package private) Spliterator<E>	spliterator	Is used to split a collection and create new recursive tasks during the computation.

Constructor Summary

Constructors

Constructor	Description
MaxEdgeWeightTask(Spliterator<E> spliterator, long loadBalancing)	Constructs a new instance for the given spliterator and loadBalancing

Method Summary

Modifier and Type	Method	Description
protected Double	compute()	Computes maximum edge weight.

Methods inherited from class RecursiveTask

exec, getRawResult, setRawResult

Methods inherited from class ForkJoinTask

adapt, adapt, adapt, adaptInterruptible, adaptInterruptible, adaptInterruptible, cancel, compareAndSetForkJoinTaskTag, complete, completeExceptionally, exceptionNow, fork, get, get, getException, getForkJoinTaskTag, getPool, getQueuedTaskCount, getSurplusQueuedTaskCount, helpQuiesce, inForkJoinPool, invoke, invokeAll, invokeAll, invokeAll, isCancelled, isCompletedAbnormally, isCompletedNormally, isDone, join, peekNextLocalTask, pollNextLocalTask, pollSubmission, pollTask, quietlyComplete, quietlyInvoke, quietlyJoin, quietlyJoin, quietlyJoinUninterruptibly, reinitialize, resultNow, setForkJoinTaskTag, state, tryUnfork

Methods inherited from class Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Details

spliterator

Spliterator<E> spliterator

Is used to split a collection and create new recursive tasks during the computation.

loadBalancing

long loadBalancing

Amount of edges which are processed in parallel.

Constructor Details

MaxEdgeWeightTask

MaxEdgeWeightTask(Spliterator<E> spliterator,
 long loadBalancing)

Constructs a new instance for the given spliterator and loadBalancing

Parameters:

spliterator - spliterator

loadBalancing - loadBalancing

Method Details

compute

protected Double compute()

Computes maximum edge weight. If amount of edges in spliterator is less than loadBalancing, then computation is performed sequentially. If not, the spliterator is used to split the collection and then two new child tasks are created.

Specified by:

compute in class RecursiveTask<Double>

Returns:

max edge weight