Scribd
Upload
29 views2 pages

Algorithms Worksheet 5 Optimisation Algorithms

The document outlines the process of using Dijkstra's algorithm to find the shortest path in a weighted graph, starting from node A. It details the initial state of the priority queue, the temporary distances assigned to each node, and the subsequent updates as nodes are visited. The document also includes specific steps showing how the priority queue evolves and which nodes are visited next, ultimately leading to the shortest distances from the start node to all other nodes.

Uploaded by

prans824
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
29 views2 pages

Algorithms Worksheet 5 Optimisation Algorithms

The document outlines the process of using Dijkstra's algorithm to find the shortest path in a weighted graph, starting from node A. It details the initial state of the priority queue, the temporary distances assigned to each node, and the subsequent updates as nodes are visited. The document also includes specific steps showing how the priority queue evolves and which nodes are visited next, ultimately leading to the shortest distances from the start node to all other nodes.

Uploaded by

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

Worksheet 5 Optimisation algorithms

Unit 8 Algorithms

0Worksheet 5 Optimisation algorithms


1. The questions below refer to the following weighted graph.
(a) The priority queue at the start is shown below. Mark these “costs” at each vertex.

A=0 B=∞ C=∞ D=∞ E=∞ F=∞

(b) Djikstra’s algorithm is used to find the shortest distance form the start node A to every
other node.
Show the temporary distances assigned to each node, and the state of the priority
queue after A and C have been visited.

Priority queue:

A=0 C=5 D=7 B = 10 E = 10 F=∞

Once these distances have been added to the priority queue, the algorithm proceeds
as follows:
While the priority queue is not empty:
Remove the node at the front of the queue. This is the current node.
For each neighbour, compute new distance by adding together the temporary
distance at the current node and the length of the edge going to that neighbour.
If the new distance is less than the neighbour’s current distance, replace the
neighbour’s distance by the new distance.

1
Worksheet 5 Optimisation algorithms
Unit 8 Algorithms
(c) Which is the next node to be visited? What will be the state of the priority queue, and
the temporary distance at F, after this node has been visited?
D will be visited next
Priority queue:

D=7 B = 10 E = 10 F = 27

(d) Will any further changes be made to temporary distances after this step? Explain.
Changes only F as it is the only node with an unvisited edge from D so when D is
visited next the distance of D will decrease from ∞ to 27

2. Use Djikstra’s algorithm to find the shortest distance from A to every other node. Colour
each node as it is completed or visited (dequeued) and enter the temporary distances on
the graph, changing them if and when required to end up with the shortest distances.

Show the state of the priority queue as each node is visited.

Priority queue

A=0 B=∞ C=∞ D=∞ E=∞ F=∞ G=∞ H=∞


0 15 3 ∞ ∞ ∞ ∞ ∞
0 15 3 5 ∞ ∞ ∞ ∞
0 15 3 5 ∞ 10 6 ∞
0 15 3 5 ∞ 10 6 ∞
0 15 3 5 15 10 6 ∞
0 15 3 5 15 10 6 27

You might also like