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