Re: longest path through a task

[brbarkstrom@gmail.com]

There are well-known algorithms for computing schedules.  I'd recommend
Sedgewick, R. and Wayne, K., 2011: Algorithms, Fourth Edition, Addison-
Wesley, Upper Saddle River, NJ.  What you want should emerge from a Critical
Path Method (or PERT) algorithm as the time on the critical path, which 
is the longest time through the job network.  The classic, single core 
(non-threaded) algorithm is covered on pp. 574-584.  The "parallel precedence-
constrained scheduling" algorithm starts on p. 663.  The algorithms in this 
book use Java, but they should be fairly easy to translate to Ada.  This book's
algorithms are noted for being concise - and even elegant.  This approach
is probably not quite as easy as trying to find a package that already 
contains what you're looking for (you hope).  However, when you get done,
you'll understand the pieces better and know where the weaknesses are.

Bruce B.