Scribd
Upload
42 views

Shortest Path Problem

This document outlines a shortest path problem, listing distances between nodes S, A, B, C, D, E, and T. It shows the shortest total distance between S and T is 11 by going through nodes S, C, D, T, with a net flow equaling -1.

Uploaded by

overhear sby
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
42 views

Shortest Path Problem

This document outlines a shortest path problem, listing distances between nodes S, A, B, C, D, E, and T. It shows the shortest total distance between S and T is 11 by going through nodes S, C, D, T, with a net flow equaling -1.

Uploaded by

overhear sby
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Shortest Path Problem

From To Distance Go Nodes Net Flow Supply/Demand


S A 4 1 S 1 = 1
S B 2 0 A 0 = 0
S C 8 0 B 0 = 0
A C 5 0 C 0 = 0
A D 2 1 D 0 = 0
B C 6 0 E 0 = 0
B E 9 0 T -1 = -1
C A 5 0
C B 6 0
C D 1 0 2
A D
C E 3 0
4 5 1 7
C T 4 1
D A 2 0 8 4
S C T
D C 1 1
D T 7 0
6 3
2 5
E B 9 0
B E
E C 3 0 9
E T 5 0

Total Distance 11

You might also like