Scribd
Upload
50 views

D1, L6 3 Dijkstra's Algorithm

Uploaded by

mokhtarppg
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
50 views

D1, L6 3 Dijkstra's Algorithm

Uploaded by

mokhtarppg
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 17

Shortest Path

Dijkstras Algorithm
finds the shortest path from the start vertex to every other
vertex in the network. We will find the shortest path from A to G
B

7
3

2
G

Dijkstras Algorithm
1.

Label the start vertex with permanent label 0 and order label 1

Assign temporary labels to all the vertices that can be reached


directly from the start

Select the vertex with the smallest temporary label and make its
label permanent. Add the correct order label.

Put temporary labels on each vertex that can be reached directly


from the vertex you have just made permanent. The temporary
label must be equal to the sum of the permanent label and the
direct distance from it. If there is an existing temporary label at a
vertex, it should be replaced only if the new sum is smaller.

Select the vertex with the smallest temporary label and make its
label permanent. Add the correct order label.

Repeat until the finishing vertex has a permanent label.

To find the shortest paths(s), trace back from the end vertex to the
start vertex. Write the route forwards and state the length.

Order in which
vertices are
labelled.

Dijkstras
Algorithm

B
1

A
Label vertex A
1 as it is the first
vertex labelled

Working

Distance from
A to vertex

7
3

2
G

Dijkstras
Algorithm

We update each vertex adjacent to A


with a working value for its distance
from A.

B
1

7
3

2
G

C
3

Dijkstras
Algorithm
4

B
1

7
3

3
Vertex C is closest
to A so we give it a C
permanent label 3.
2
C is the 2nd vertex to 3
be permanently
labelled.

2
G

5
3

Dijkstras
Algorithm

We update each vertex adjacent to C with a


working value for its total distance from A, by
adding its distance from C to Cs permanent
label of 3.

B
1

6 < 7 so
replace the
t-label here

7 6

7
3

2
G

C
2
3

E
8

Dijkstras
Algorithm
3
4

B
1

The vertex with the


smallest temporary label is
B, so make this label
permanent. B is the 3rd
vertex to be permanently
labelled.

7 6

7
3

2
G

C
2
3

E
8

Dijkstras
Algorithm
3
4

We update each vertex adjacent to B with a


working value for its total distance from A, by
adding its distance from B to Bs permanent
label of 4.

B
1

5 < 6 so
replace the
t-label here

7 6 5

7
3

2
G

C
2
3

E
8

Dijkstras
Algorithm
3
4

The vertex with the smallest


temporary label is D, so
make this label permanent. D
is the 4th vertex to be
permanently labelled.

B
1

4
5
7 6 5

1
7

7
3

2
G

C
2
3

E
8

Dijkstras
Algorithm
3
4

We update each vertex adjacent to D with a


working value for its total distance from A, by
adding its distance from D to Ds permanent
label of 5.

B
1

4
5
7 6 5

1
7

8 7

7 < 8 so
replace the
t-label here

7
3

C
2
3

7 < 8 so
replace the
t-label here

8 7

12

Dijkstras
Algorithm
3
4

B
1

4
5
7 6 5

1
7

8 7

7
3

2
G

C
2
3

E
5
8 7

12

The vertices with the smallest


temporary labels are E and F, so
choose one and make the label
permanent. E is chosen - the 5th
vertex to be permanently labelled.

Dijkstras
Algorithm
3
4

We update each vertex adjacent to E with a


working value for its total distance from A, by
adding its distance from E to Es permanent
label of 7.

B
1

4
5
7 6 5

1
7

8 7

7
3

2
G

C
2
3

E
5
8 7

12 9
9 < 12 so
replace the
t-label here

Dijkstras
Algorithm
3
4

The vertex with the smallest


temporary label is F, so make
this label permanent.F is the
6th vertex to be permanently
labelled.

B
1

4
5
7 6 5

1
7

6
7
8 7

7
3

2
G

C
2
3

E
5
8 7

12 9

Dijkstras
Algorithm
3
4

We update each vertex adjacent to F with a


working value for its total distance from A, by
adding its distance from F to Fs permanent
label of 7.

B
1

4
5
7 6 5

1
7

6
7
8 7

7
3

2
G

C
2
3

E
5
8 7

12 9
11 > 9 so do
not replace
the t-label
here

Dijkstras
Algorithm
3
4

B
1

4
5
7 6 5

1
7

6
7
8 7

7
3

2
G

C
2
3

E
5
8 7

7
9
12 9
G is the final vertex
to be permanently
labelled.

Dijkstras
Algorithm
3
4

To find the shortest path from A to G, start from


G and work backwards, choosing arcs for
which the difference between the permanent
labels is equal to the arc length.

B
1

4
5
7 6 5

1
7

6
7
8 7

7
3

2
G

C
2
3

E
5
8 7

The shortest path is ABDEG, with length 9.

7
9
12 9

You might also like