Scribd
Upload
10 views7 pages

Dijkstra's Algorithm

The document outlines Dijkstra's Algorithm for finding the shortest path between various nodes, including paths from A to E, A to Z, and City-1 to City-5. It presents a structure for tracking visited nodes, shortest distances, and previous nodes. The algorithm is applied to multiple scenarios to demonstrate its functionality.

Uploaded by

Sooraj Rajmohan
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
10 views7 pages

Dijkstra's Algorithm

The document outlines Dijkstra's Algorithm for finding the shortest path between various nodes, including paths from A to E, A to Z, and City-1 to City-5. It presents a structure for tracking visited nodes, shortest distances, and previous nodes. The algorithm is applied to multiple scenarios to demonstrate its functionality.

Uploaded by

Sooraj Rajmohan
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/ 7

Dijkstra's Algorith(Shortest path from A to E)

Visited Node Shortest Previous


Distance Node
Dijkstra's Algorith(Shortest path from a to z)

Visited Node Shortest Previous


Distance Node
Dijkstra's Algorith(Shortest path from City-1 to City-5)

Visited Node Shortest Previous


Distance Node
Dijkstra's
Algorith(Shortes
t path from
City-1 to City-5)
Dijkstra's Algorith(Shortest path from A to F)

Visited Node Shortest Previous


Distance Node

You might also like