Even if critical path analysis does not exactly excite you, this program can he used to find the longest or the shortest route through a large maze. As dimensioned, it will handle a network of up to 50 nodes or junctions, each of which mav hâve up to 5 outlets. The joining links can represent distance or time and the program will list ail possible paths, the longest path, or the one with most nodes. Loop back conditions are automatically rejected by the program. Draw vour own network on paper and enter the separate link details in the data Unes. Then press the kev, sit back and watch the computer displav the path analysis. |
