Dijkstra’s Algorithm Assignment:

Problem:- This project is a simple implementation of Dijkstra’s Algorithm in C++.
It finds the shortest path between two nodes in a weighted graph.

Example 1: Enter start node (0-5): 0 Enter end node (0-5): 3 Shortest distance from 0 to 3 is: 9 Path: 0 -> 2 -> 4 -> 3

Example 2: Enter start node (0-5): 1 Enter end node (0-5): 5 Shortest distance from 1 to 5 is: 21 Path: 1 -> 2 -> 4 -> 3 -> 5

Example 3: Enter start node (0-5): 4 Enter end node (0-5): 10 No path exists between 4 and 10