The time of events can be found as follows:
By considering nodes in topological sort order, we know that the time of each predecessor will be computed before it is needed.
We can compute the latest completion time for each node, in reverse topological order, as:
Slack for an edge (i,j) is: slacki,j = latestj - timei - costi, j
Contents Page-10 Prev Next Page+10 Index