Shortening the Project Duration

modeled as the shortest path problem

Arcs Nodes
From To Level Time Cost
A B1 1 4 3 A
A B2 0 3 6 B1
A B3 0 1 9 B2
B2 B1 0 0 0 B3
B3 B1 0 0 0 C1
B1 C1 1 3 6 C2
B1 C2 0 2 9 D1
C2 C1 0 0 0 D2
C1 D1 1 4 8 E1
C1 D2 0 2 10 E2
D2 D1 0 0 0
D1 E1 1 2 3
D1 E2 0 1 6
E2 E1 0 0 0

Cost = 20 <= 25

Project duration = 13
Net Flow = Value
1 = 1 The first node
0 = 0
0 = 0
0 = 0
0 = 0
0 = 0
0 = 0
0 = 0
-1 = -1 The last node
0 = 0