The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+2 votes

Algorithm which solves the all pair shortest path problem is

A)Dijkstra's algorithm

B)Floyd's algorith

C)Prim's algorithmm

D)Warshall's algorithm

asked in DS by Junior (509 points) | 1.6k views

2 Answers

+3 votes
A)Dijkstra->>Single Source Shortest Path

C) Prims->>To obtain Minimum Spanning Tree

B&D) Floyd-Warshall Algo->>All pair Shortest path

Robert Floyd & Stephen Warshall two scientist :-from there name a single dynamic algorithm Floyd-Warshall...(Note:-they are not 2 different algorithms.. So, they should not given in two options)
answered by Veteran (23.4k points)
0 votes
you give options wrong because floyd's and warshall's are not two different algorithms . floyd-warshall algorithm is used to find the all pair shortest path problem.
answered by (113 points)

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

33,620 questions
40,170 answers
38,552 users