Add Dijkstra's algorithm implementation in C++, using a min-heap.
Description
This pull request adds an implementation of Dijkstra's algorithm using a min-heap (priority queue).
The algorithm finds the shortest paths from the source vertex to all other vertices in a weighted graph.
The implementation includes a sample test case which can be uncommented in the main function for demonstration purposes.
@kelvins I have uncommented the main function and added the link to the README file as requested. Can you please review the updated changes. Thank you!
Add Dijkstra's algorithm implementation in C++, using a min-heap.
Description
This pull request adds an implementation of Dijkstra's algorithm using a min-heap (priority queue). The algorithm finds the shortest paths from the source vertex to all other vertices in a weighted graph. The implementation includes a sample test case which can be uncommented in the main function for demonstration purposes.