Overview

critical path algorithm


Show Summary Details

Quick Reference

A forward scan determines the earliest time for each vertex (node) in an activity network, and a backward scan determines the latest time for each vertex. The critical path is any path on which the latest time=the earliest time at every vertex, i.e. on which any delays would mean the delay of the completion of the project.

Subjects: Mathematics.


Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.