Computing the duration of the network after all logic is completed and all time estimates are included, requires a forward and a backward "pass" resulting in:

New logic for the schedule if it exceeded the desired time duration

A sort of all activities into a forward group and a backward group

Identification of float on each activity, and the critical path

Separating the critical path from the non$-$critical path activities in the network