The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+3 votes
637 views

Floyd-Warshall algorithm utilizes _____ to solve the all-pairs shortest paths problem on a directed graph in ____ time

  1. Greedy algorithm, $\theta(V^3)$
  2. Greedy algorithm, $\theta(V^2 lgn)$
  3. Dynamic programming, $\theta(V^3)$
  4. Dynamic programming, $\theta(V^2 lgn)$
in Others by Veteran (103k points)
retagged by | 637 views

1 Answer

+3 votes
Floyd-Warshall algorithm dynamic approch takes Θ(n^3) time.

C is answer
by Veteran (62.5k points)

Related questions

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
50,362 questions
55,786 answers
192,411 comments
90,919 users