Question

To find the shortest-path in a weighted graph or network, which of the following algorithm is not used?

• A. Warshall's algorithm
• B. Dijkastra algorithm
• C. Kruskal algorithm
• D. None of the above

Answer 1

The correct option is A Warshall's algorithm

To find the shortest-path in a weighted graph or network, Warshall's algorithm is not used.

Floyd–Warshall algorithm is an algorithm for finding shortest paths in a weighted graph with positive or negative edge weights. A single execution of the algorithm will find the lengths of shortest paths between all pairs of vertices.

In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized.