Scribd
Upload
37 views1 page

Dijkstra's Algorithm

Uploaded by

Anup Muttha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
37 views1 page

Dijkstra's Algorithm

Uploaded by

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

Dijkstra's algorithm

Dijkstra's algorithm is an algorithm for


finding the shortest paths between
nodes in a graph, which may
represent, for example, road
networks.

Application
1.

It is most widely used in finding the


shortest possible distance and showing
Dr. Michael J. Ryan, WHO Informal Advisory
Group, March 2020

directions between 2 geographical


locations such as in Google Maps.
2. This is also widely used in the routing of
data in networking and telecommunication
domains for minimizing the delay occurred
for transmission.
3. Wherever you encounter the need for
shortest path solutions be it in robotics,
transportation, embedded systems, factory
or production plants to detect faults, etc
this algorithm is used.

38 - Omkar Kulkarni
40 - Anup Muttha

You might also like