Q15Multiple correct3 Marks24 Dec 2023

Which of the following is (are) correct?

A

Floyd-Warshall algorithm works for graphs with negative weight cycles.

B

Floyd-Warshall algorithm is used for all pair shortest paths.

C

The Shortest path problem is not applicable to a graph with a negative weightcycle.

D

Bellman-Ford algorithm is used for single source shortest path.

E

Dijkstra's algorithm is used for all pair shortest paths.