Re: longest path through a task

[jan.de.kruyf@gmail.com]

On Thursday, May 28, 2015 at 2:27:18 PM UTC+2, brbar...@gmail.com wrote:
> 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

Shucks, caught sleeping at the wheel again! Yes of course thank you Bruce. 
It will probably work much better, together with the execution time measuring device I concocted, then any package. 

By the way for whoever comes after me:

ftp://91.193.236.10/pub/docs/linux-support/computer%20science/data%20Structures%20&%20algorithms/%5BPearson%5D%20-%20Algorithms,%204th%20ed.%20-%20%5BSedgewick,%20Wayne%5D.pdf

I was very grateful for it, since to get books here in SA is a major undertaking! The national airline does not transport post anymore for the national post-office because they forgot to pay!. 

cheers,

j.