Which of the following standard algorithms is not Dynamic Programming based?
Bellman–Ford Algorithm for single source shortest path
Floyd Warshall Algorithm for all pairs shortest paths
0-1 Knapsack problem
Prim's Minimum Spanning Tree
This question is part of this quiz :