An algorithm for finding the shortest path between two vertices in a weighted graph, even if the graph contains negative-weight edges.
An algorithm for finding the shortest path between two vertices in a weighted graph, even if the graph contains negative-weight edges.