Shortest Path Problem

From To Distance Go Nodes Net FlowS A 4 1 S 1 =S B 2 0 A 0 =S C 8 0 B 0 =A C 5 0 C 0 =A D 2 1 D 0 =B C 6 0 E 0 =B E 9 0 T -1 =C A 5 0C B 6 0C D 1 0C E 3 0C T 4 1D A 2 0D C 1 1D T 7 0E B 9 0E C 3 0E T 5 0

Total Distance 11

S

A

B

C

4

2

8

2

9

5 1

6 3

Supply/Demand100000-1

D

E

T

7

5

4

3