Modified Dijkstra's
Modified Dijkstra's algorithm is a variation of Dijkstra's algorithm used to find the shortest path from a source node to all other nodes in a weighted graph.
Unlike traditional Dijkstra's algorithm, the modified version can handle negative edge weights by applying a relaxation condition that prevents infinite loops in the presence of negative cycles.
It uses a priority queue to track tentative distances and includes a negative cycle detection mechanism to report or handle cycles when detected.
Applied in network routing, graph analysis, and resource allocation, Modified Dijkstra's adapts to dynamic link costs and discovers shortest paths efficiently even with negative weights.