Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 2

MAICA FETALINO BSA II-A

ACTIVITY: Identify the shortest route based on the two networks above. Numbers per arc
represents number of minutes.

a. Origin – home / Destination -


office 

LET: H be the home [point of origin]


O be the office [point of destination]
P {} be the set of permanents nodes for shortest route

PERMANENT SET NODES MINUTES


P {H} H-A 5
H-D 8
P {H, D} H-D 8
D-C 12
D-E 14
P {H, D, A} D-C 12
D-E 14
A-B 14
A-C 8
P { H, D, A, C} D-E 14
A-B 14
C-B 13
C-E 10
P { H, D, A, C, B} A-B 14
C-B 13
B-O 20
P {H, D, A, C, B , E} E-O 14
B-O 20
Therefore the shortest route is from HOME-A-C-E-OFFICE that has only 14 minutes.

Another method
b. Origin – S / Destination - T 

LET: S [point of origin]


T [point of destination]
P {} be the set of permanents nodes for shortest route

PERMANENT SET NODES MINUTES


P {S} S-A 4
S-C 8
S-B 2
P {S, A} S-A 4
S-C 8
A-D 6
A-C 9
P {S, A, B} S-C 8
A-D 6
A-C 9
B-C 8
B-E 11
P {S, A, B, C } S-C 8
A-C 9
B-C 8
B-E 11
C-E 11
C-T 12
P { S, A, B, C, D } B-E 11
C-E 11
C-T 12
D-T 13
P {S, A, B, C, D, E} C-T 12
D-T 13
E-T 16
Therefore the shortest route is S-C-T or S-B-C-T that has 12 minutes

Another Method:

You might also like