Critical path algorithm

• Data : a network R = (V,E,c) associated with a project and whose tops were numbered in a way compatible with the range. 

• Result: Minimal duration D of the project and, for each work I, the date of beginning to earliest of work and the date of beginning at the latest of this same work. 

(1) Recurrence while advancing in the project (calculation of the dates of beginning to earliest)

Put

for K= 2,…n put

Diapositiva precedente

Diapositiva successiva

Torna alla prima diaposiva

Visualizza versione grafica