Algorithms Graphs/Spanning Tree and Shortest Paths Shortest Paths

Which of the following algorithm solves the all-pair shortest path problem?

1

Prim’s algorithm

2

Dijikstra’s algorithm

3

Bellman-Ford’s algorithm

4

Floyd-Warshall’s algorithm

Sponsored

hivanix.in

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters