FEATURE REQUEST] Dijkstra's Algorithm with Priority Queue

[Raghu0703]

What would you like to share?

Implement Dijkstra's algorithm for finding shortest paths from a source vertex to all other vertices in a weighted graph.
Key Features:

Use PriorityQueue for optimal performance
Handle negative weights detection
Time Complexity: O((V + E) log V)
Include practical examples (GPS routing, network routing)

Additional information

No response

[GoodBoiDoom]

/attempt

[bhavani1406-amc]

Hello! I am a first-time contributor and I am comfortable with Java and Dijkstra's algorithm. I noticed this is a feature request; I'd like to work on this. Could you please assign it to me?

[Alefiya101]

I’d love to take this up if it’s still available.

From my understanding, this can be implemented efficiently in Java using an adjacency list and a min-heap (PriorityQueue), ensuring the expected O((V + E) log V) time complexity. I’ll also explicitly validate that all edge weights are non-negative, since Dijkstra’s algorithm does not support negative weights, and fail fast otherwise.

I plan to keep the implementation clean and well-documented, with clear variable naming, inline explanations for the relaxation step, and a small example to demonstrate usage (aligned with the repository style).

If that sounds good, I’d be happy to work on this—please let me know if I can be assigned.

Thanks for maintaining this project!

[github-actions]

This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contribution!