Scribd
Upload
28 views

Dijkstras-Algorithm-Finding-Optimal-Paths

Uploaded by

saqibkhanwazir531
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
28 views

Dijkstras-Algorithm-Finding-Optimal-Paths

Uploaded by

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

Dijkstra's Algorithm:

Finding Optimal Paths


Introduction to Dijkstra's Algorithm
What is it? Why is it important?

Dijkstra's Algorithm is a foundational algorithm in It finds the optimal path efficiently and has wide-
computer science used for finding the shortest path ranging applications, from navigation apps to network
between two points in a graph. routing.
Definition and Significance
Core Principle Key Features
Dijkstra's Algorithm works It's guaranteed to find the
by iteratively exploring a shortest path if the edge
graph, maintaining a set of weights are non-negative,
known shortest distances making it a robust and
from a starting node to all reliable solution.
other nodes.
Common Use Cases
Navigation Network Routing
Apps like Google Maps use Data packets traversing the
Dijkstra's Algorithm (or internet use routing
variations) to determine the protocols that leverage
fastest route based on shortest path algorithms like
traffic conditions. Dijkstra's.

Resource Allocation
In telecommunications, network operators utilize Dijkstra's
Algorithm for efficient resource allocation and traffic
management.
Step-by-Step Explanation
1 Initialization
Assign each node a tentative distance value: 0 for the start node
and infinity for all others.

2 Selection
Select the node with the smallest tentative distance that is not yet
marked as visited.

3 Distance Update
For each unvisited neighbor of the selected node, update its
tentative distance if a shorter path is found.

4 Termination
The algorithm terminates when the destination node is marked as
visited, or when all nodes have been visited.
Initialization

Start Node Distances


The algorithm starts at a All nodes except the start node
designated node, usually called are initially assigned an infinite
the source node. distance value.

Priority Queue
A priority queue is used to
efficiently track the nodes with
the smallest tentative
distances.
Selecting the Next Vertex
Unvisited Node
The algorithm selects the unvisited node with the
smallest tentative distance from the priority queue.

Visited Node
The selected node is marked as visited, indicating
that its shortest path has been found.
Updating Distance Estimates

Neighbors
1 The algorithm considers all unvisited neighbors of the selected node.

Shortest Path
2 For each neighbor, it calculates the tentative distance through
the selected node and compares it to the current tentative
distance.

Distance Update
3 If the tentative distance through the selected node is
shorter, it updates the neighbor's tentative distance.
Termination Condition
Destination Node
1 The algorithm terminates when the destination node is visited, meaning its
shortest path from the start node has been found.

All Nodes Visited


Alternatively, the algorithm terminates when all
2
nodes have been visited, indicating that shortest
paths to all nodes have been calculated.
Visual Representation of
Dijkstra's Algorithm

1 2
Initialization Node Selection
The algorithm starts with all nodes The node with the smallest tentative
having infinite distance except the distance is selected and marked as
source node, which has a distance of visited.
0.

3 4
Distance Update Termination
The tentative distances of the selected The algorithm stops when the
node's neighbors are updated if destination node is visited, or when all
shorter paths are found. nodes are visited.

You might also like