All paths in an activity network

The known CPM/PERT methods are available for the determination of the critical edges and a critical path. I n this paper we give two algorithms: one of them is used for the determination of all critical paths, the second for the determination of the second longest paths. The validity of the algorithms and the labelling technique are also given.