Register
Dark Mode

ISRO2017-76

in Algorithms reopened by
4,395 views
5 votes
5 votes

Which of the following algorithms solves the all pair shortest path problem?

  1. Prim's algorithm
  2. Dijkstra's algorithm
  3. Bellman ford algorithm
  4. Floyd warshalls algorithm
in Algorithms reopened by
by
4.4k views

3 Answers

8 votes
8 votes
Best answer
Option D will be correct...

Floyd warshalls algorithm is based on dynamic paradigm approach which is used to solve All pair shortest path problem..
selected by
by
5 votes
5 votes
  1. Prim's algorithm-------> spanning Tree
  2. Dijkstra's algorithm------> single source shortest path
  3. Bellman ford algorithm-------> single source shortest path
  4. Floyd warshalls algorithm----->all pair shortest path

so ans: D

by

1 comment

by
  1. Minimum spanning tree
0
0
–1 vote
–1 vote
(d) has least complexity 0(v3) as solved by   dynamic approach
edited by
by
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

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

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!