Scribd
Upload
4 views

Dijkstra Algorithm Notes

The document discusses Dijkstra's algorithm, an optimization algorithm used to find the shortest path in a weighted graph, contrasting it with breadth-first search (BFS). It outlines the algorithm's steps, including initialization, distance calculation, and node selection, while noting its inefficiency for targeting a specific node compared to alternatives like A* that utilize heuristics. Key terms related to the algorithm are also defined, enhancing understanding of its components and functionality.

Uploaded by

Saemai
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

Dijkstra Algorithm Notes

The document discusses Dijkstra's algorithm, an optimization algorithm used to find the shortest path in a weighted graph, contrasting it with breadth-first search (BFS). It outlines the algorithm's steps, including initialization, distance calculation, and node selection, while noting its inefficiency for targeting a specific node compared to alternatives like A* that utilize heuristics. Key terms related to the algorithm are also defined, enhancing understanding of its components and functionality.

Uploaded by

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

Video Title: Specification Topic:

AQA A’Level Dijkstra’s shortest path 4.3.6

Questions Notes

1. How does Dijkstra’s Optimisation Algorithms:


algorithm differ from -An optimisation algorithm aims to find the best possible
the breadth-first search solution to a problem.
in terms of pathfinding?
Purpose and Behaviour of Dijkstra’s Algorithm:
2. When and why might -Dijkstra's Algorithm is an optimisation algorithm that finds
Dijkstra’s algorithm the shortest path from a starting node to every other node
become inefficient? in a weighted graph.
-Dijkstra’s algorithm uses a priority queue to always follow
3. What type of data the shortest unvisited path, unlike BFS which uses a
structure does standard queue
Dijkstra’s algorithm use -It Works well for finding paths across all nodes, but may be
to track nodes and inefficient if only the shortest path to one specific target
distances? node is needed.
-Alternative algorithms like A* are more efficient for
pathfinding to a specific target node, as they include
heuristics for more direct paths.

Dijkstra’s Algorithm Overview:


-Step 1 Initialization:
--Set the distance to the start node as 0 and to all other
nodes as infinity (∞).
--Mark all nodes as unvisited and set the start node as the
current node.
-Step 2 Calculate Distances:
--For each unvisited neighbour of the current node,
calculate the tentative distance from the start node.
--Update the neighbour’s distance if the calculated distance
is less than its current distance.
-Step 3 Mark and Move:
--Once all neighbours of the current node are checked, mark
the current node as visited (visited nodes won’t be
checked again).
--Select the unvisited node with the smallest tentative
distance as the new current node.
-Step 4 Repeat:
--Repeat the Calculate Distances and Mark and Move steps
until all nodes are visited or the target node is reached
(if applicable).
-Step 5 Final Output:
--The algorithm produces a list showing: Node labels, Cost
of the shortest path from the start node to each node and
the previous node in the path to help trace the shortest
path.

Key Terms

Optimisation Algorithm Dijkstra’s Algorithm

Weighted Graph Priority Queue

Tentative Distance Heuristics

Shortest Path A*’s Algorithm

You might also like