Program Activity Graph Routine in GW Basic

[OldTimer-99]

I am having great difficulties to write a computer program in GW BASIC to find the longest path in a project network (critical path) as per example attached.

Actually, it’s not the programming that is the problem but finding an easily understood algorithm to do it. The computer code I find to solve this problem is always in Java and I do not have experience in this language.

If anyone has already developed such a routine I would appreciate having a copy of it.

[DaveLembke]

GW Basic I started playing with back around 1985 with DOS 2.11.

Is there a reason why your using GW Basic when its been obsolete for over 25 years. QBasic supported legacy GW Basic Programs in the early 90s and the Visual Basic came in the mid to late 90s to take the place of QBasic.

GW Basic is only able to run within 64k memory and so your very limited in how large the program can be.

I'd avoid GW-Basic and learn Java for this.