Scribd
Upload
18 views4 pages

Introduction To Dijkstras Algorithm

Uploaded by

suhasgrt2003
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
18 views4 pages

Introduction To Dijkstras Algorithm

Uploaded by

suhasgrt2003
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/ 4

Introduction to

Dijkstra's
Dijkstra's algorithm, named after Dutch computer scientist

Algorithm
Edsger Dijkstra, is a popular algorithm used in graph theory to
find the shortest path between nodes in a graph, which may
represent, for example, road networks. It's widely used in
navigation systems and telecommunications networks.
How Dijkstra's Algorithm
Works
Initialization Greedy Track Shortest
Selection Path
The algorithm assigns It selects the The algorithm keeps
a tentative distance unvisited node with track of the shortest
value to every node. the smallest distance, path to each node
The initial node's calculates the and, once all nodes
distance is set to distance through it to have been visited,
zero, and all other each unvisited the shortest path
nodes have an initial neighbor, and from the start to the
distance of infinity. updates the target node is
Applications of Dijkstra's
Algorithm
1 GPS Route 2 Network Routing
Finding Protocols
It's used in GPS devices to find In computer networks, it's used
the shortest route from one to find the best path for data to
location to another, considering travel through a network,
traffic conditions and live minimizing delays and
updates. congestion.
3 Telecommunications Networks
Telecommunication companies use it for optimizing their network
infrastructure and managing connections efficiently.
Limitations and Variations of
Dijkstra's Algorithm
Limitations Variations

Dijkstra's algorithm doesn't work with There are variations of the algorithm,
negative edge weights and can't like A* algorithm, which uses
handle changing constraints in real- heuristics to find a more optimized
time. path and can handle certain types of
constraints better.

You might also like