Professional Documents
Culture Documents
Shortest Path Problem
Shortest Path Problem
From
S
S
S
A
A
B
B
C
C
C
C
C
D
D
D
E
E
E
To
A
B
C
C
D
C
E
A
B
D
E
T
A
C
T
B
C
T
Distance
4
2
8
5
2
6
9
5
6
1
3
4
2
1
7
9
3
5
Go
1
0
0
0
1
0
0
0
0
0
0
1
0
1
0
0
0
0
Total Distance
11
Nodes
S
A
B
C
D
E
T
Net Flow
1
0
0
0
0
0
-1
A
4
5
8
1
C
2
B
=
=
=
=
=
=
=
3
9
Supply/Demand
1
0
0
0
0
0
-1
D
7
4
3
T
5