A C D E G I L M N O P R S T U V Z

D

dependenciesValid(ScheduleGrph) - Method in class util.ScheduleGrph

Check if this ScheduleGraph is valid with regards to tasks only starting after their dependencies and dependency transfer (if on diff processors) are finished.

DFSAlgorithm - Class in alg

The DFSAlgorithm class provides an implementation of the DFS / BB A* algorithm in a sequential (non parallelized) manner.

DFSAlgorithm(ScheduleGrph, CostFunction, int) - Constructor for class alg.DFSAlgorithm

Sets up the DFS algorithm without visualization

DFSAlgorithm(ScheduleGrph, CostFunction, int, ScheduleListener) - Constructor for class alg.DFSAlgorithm

Sets up the DFS alg with visualization

DFSParallel - Class in alg

This is an entry point for the DFS parallelized version.

DFSParallel(ScheduleGrph, CostFunction, int, int) - Constructor for class alg.DFSParallel

Sets up the DFS algorithm without visualization

DFSParallel(ScheduleGrph, CostFunction, int, int, ScheduleListener) - Constructor for class alg.DFSParallel

Sets up the DFS alg with visualization

DFSTask - Class in alg

The DFS Task class provides a fork-join recursive action for the DFS / BB A* algorithm

DFSTask(ScheduleGrph, PartialScheduleGrph, PartialScheduleGrph, CostFunction, HashSet<String>, int, int, AtomicLong, AtomicLong) - Constructor for class alg.DFSTask

Sets up the DFS task without visualization

DFSTask(ScheduleGrph, PartialScheduleGrph, PartialScheduleGrph, CostFunction, HashSet<String>, int, int, AtomicLong, AtomicLong, ScheduleListener) - Constructor for class alg.DFSTask

Sets up the DFS task with visualization

A C D E G I L M N O P R S T U V Z