Concept drill
floyd-warshall
GATE CSE & IT · Dynamic Programming · 1998-2017
4
PYQs
100%
keyed
0
elite explanations
4
years appeared
Study anchor
Cormen et al. — Introduction to Algorithms (CLRS)
Algorithms, data structures, graph algorithms, complexity
Practice action
Start latest PYQPYQs in this concept
All concepts →2017 PYQ
Consider the following table : Algorithms Design Paradigms (P) Kruskal (ii) Greedy (Q) Quicksort (i) Divide and Conquer (R) Floyd–Warshall (iii) Dynamic Programming Match the algor...
easyanswer keybasic explanation
2016 PYQ
The Floyd-Warshall algorithm for all-pair shortest paths computation is based on
easyanswer key
2003 PYQ
Let G = (V, E) be a directed graph with n vertices. A path from v i to v j in G is sequence of vertices (v i , v i +1, ……., v j ) such that (v k , v k +1) ∈ E for all k in i throug...
hardanswer key
1998 PYQ
Which one of the following algorithm design techniques is used in finding all pairs of shortest distances in a graph?
easyanswer key