Scribd
Upload
33 views39 pages

Shortest Route and Minimum Spanning Tree 6th April 2020

The document describes a shortest path problem on a graph. It shows the process of finding the shortest routes between nodes by progressively adding brackets to nodes once they have been determined to be on the shortest path. The shortest path from node 1 to node 7 is 18 km going through nodes 7, 3, and 1. The shortest path from node 1 to node 6 is 16 km going through nodes 6, 4, and 1.

Uploaded by

ariff aiman mukdath
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
33 views39 pages

Shortest Route and Minimum Spanning Tree 6th April 2020

The document describes a shortest path problem on a graph. It shows the process of finding the shortest routes between nodes by progressively adding brackets to nodes once they have been determined to be on the shortest path. The shortest path from node 1 to node 7 is 18 km going through nodes 7, 3, and 1. The shortest path from node 1 to node 6 is 16 km going through nodes 6, 4, and 1.

Uploaded by

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

Shortest Route

(25,1)

Start here
[0,S]

(20,1)
[26,3]

You are here


(37,2)
(25,1) (33,5)
(23,3)
[23,3]
(28,2)
(30,5)

Start here
[0,S]

(26,3)
[26,3]
(20,1)
[20,1]
(37,2)
(25,1) (33,5)
(23,3) (32,4)
[23,3]
(28,2)
(30,5)
[28,2]
You are here

Start here
[0,S]

(26,3)
[26,3]
(20,1)
[20,1]
Process stops when ALL nodes have [ ] brackets
Shortest route 1 to 6 = 32 miles, 6-4-2-1
Shortest route 1 to 4 = 28 miles, 4-2-1
Start here

[0,S]
(8,1)

Start here
(9,1)
[0,S]

(7,1)
Process stops because ALL nodes have [ ] brackets.
Route from 1 to 7 = 18 km , 7-3-1
Route from 1 to 6 = 16 km , 6-4-1
Exercise

8
2 5
7 8 7
8
12 10
1 3 7
6 7
5 11
4 6
9
[0,S]
(8,1)
[8,1]

(10,1)

[0,S]

(9,1)
(8,1)
[8,1] (19,2)

(10,1)
(14,2)
[0,S]

(9,1)
[9,1]
(8,1)
[8,1] (19,2)

(10,1)
(14,2)
[0,S] (20,4)

(9,1)
[9,1] (30,4)
(8,1) (19,2)
[8,1] (19,3)

(10,1)
(14,2)
[0,S] (20,4)
[10,1]

(9,1)
[9,1] (30,4)
(47,3)
Tie breaker
(19,2) (34,5)
(8,1) (19,3)
[8,1] [19,2]

(10,1)
(14,2)
[0,S] (20,4) (28,5)
[10,1]

(9,1)
[9,1] (30,4)
(47,3)
Tie breaker
(19,2) (34,5)
(8,1) (19,3) (36,6)
[8,1] [19,2]

(10,1)
(14,2)
[0,S] (20,4) (28,5)
[10,1] [28,5] (40,6)

(9,1)
[9,1] (30,4)
(47,3)
(36,6)
Tie breaker
(19,2) (34,5)
(8,1) (19,3) (36,6)
[8,1] [19,2]

(10,1)
(14,2)
[0,S] (20,4) (28,5)
[10,1] [28,5] (40,6)
(45,7)

(9,1)
[9,1] (30,4)
(47,3)
(36,6)
[30,4]
Tie breaker
(34,5)
(19,2) (36,6)
(8,1) (19,3) [34,5]
[8,1] [19,2]

(10,1)
(14,2)
[0,S] (20,4) (28,5)
[10,1] [28,5] (40,6)
(45,7)
(47,8)

(9,1)
[9,1] (30,4)
(47,3)
(36,6)
[30,4]
Tie breaker
(34,5)
(19,2) (36,6)
(8,1) (19,3) [34,5]
[8,1] [19,2]

(10,1)
(14,2)
[0,S] (20,4) (28,5)
[10,1] [28,5] (40,6)
(42,7)
(47,8)
[40,6]

(9,1)
[9,1] (30,4)
(27,3)
(36,6)
[27,3]
Minimum Spanning Tree
10
2 5
7 8 9
8
9 9
1 3 7
6 7
7 11
4 6
9
10
2 5
7 8 9
8
9 9
1 3 7
6 7
7 11
4 6
9
[0,S]
[0,S]

You might also like