Which one of the following algorithm is used for solving all pair shortest path in a weighted, directed graph ?

Which one of the following algorithm is used for solving all pair shortest path in a weighted, directed graph ?

A) Bellman Ford Algorithm.
B) Djikstra Algorithm.
C) Floyd-Warshall Algorithm.
D) Prims Algorithm.

Answer & Solution

Answer: Option C
Solution:
Floyd-Warshall Algorithm.