sampo.scheduler.heft.prioritization#

Overview#

Function#
`ford_bellman`(wg, weights)	Runs heuristic ford-bellman algorithm for given graph and weights.
`prioritization`(wg, work_estimator)	Return ordered critical nodes.

sampo.scheduler.heft.prioritization.ford_bellman(wg: sampo.schemas.graph.WorkGraph, weights: dict[sampo.schemas.graph.GraphNode, float]) → dict[sampo.schemas.graph.GraphNode, float]#: Runs heuristic ford-bellman algorithm for given graph and weights.

sampo.scheduler.heft.prioritization.prioritization(wg: sampo.schemas.graph.WorkGraph, work_estimator: sampo.schemas.time_estimator.WorkTimeEstimator) → list[sampo.schemas.graph.GraphNode]#: Return ordered critical nodes. Finish time is depended on these ordered nodes.