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

A

addFreeTask(ScheduleGrph, int, int) - Method in class util.PartialScheduleGrph
Add a free task to the earliest possible time on this schedule on the specified processor
alg - package alg
 
alg.cost - package alg.cost
 
Algorithm - Interface in alg
The Algorithm interface provides a starting point for any search algorithm to be implemented, to allow for the testing and comparison of multiple algorithms in this project.
applyCost(PartialScheduleGrph, int, int) - Method in class alg.cost.AStarCostFunction
 
applyCost(PartialScheduleGrph, int, int) - Method in interface alg.cost.CostFunction
Applies this cost function to the specified schedule graph, setting its score
applyCostParallel(PartialScheduleGrph, int, int) - Method in class alg.cost.AStarCostFunction
Apply the cost function to a graph while running on multiple cores in parallel
AStarCostFunction - Class in alg.cost
A basic cost function that assigns the end time as the cost.
AStarCostFunction(ScheduleGrph) - Constructor for class alg.cost.AStarCostFunction
Constructor.
A C D E G I L M N O P R S T U V Z 
Skip navigation links