Closed Khushi-51 closed 1 month ago
issue #44
Dijkstra's algorithm to find the shortest path in a weighted graph. The solution includes:
- Graph representation using an adjacency list.
- Use of a priority queue to optimize the selection of nodes with the minimum distance.
- Detailed comments explaining the problem and algorithm.
- A
printShortestPaths()
function to display the results for easy testing and verification.This contribution is aimed at enhancing the DSA folder as part of the GSSOC-EXT and Hacktoberfest initiatives. Looking forward to your review!
@Khushi-51 please rename your file as protocol.
issue #44
Dijkstra's algorithm to find the shortest path in a weighted graph. The solution includes:
printShortestPaths()
function to display the results for easy testing and verification.This contribution is aimed at enhancing the DSA folder as part of the GSSOC-EXT and Hacktoberfest initiatives. Looking forward to your review!