indrakishore / Developers-Community

Hactoberfest-2024

MIT License

13 stars 122 forks source link

Dijkstra.java #45

Closed Khushi-51 closed 1 month ago

Khushi-51 commented 1 month ago

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.

indrakishore commented 1 month ago

@Khushi-51 Please add approach in file and rename file as protocol.