Teaching BPSC 4.0 बिहार उच्च माध्यमिक शिक्षक भर्ती (PGT) Mock Test Algorithms Graphs/Spanning Tree and Shortest Paths Shortest Paths
Dijkstra’s algorithm is based on:
1
Greedy Approach
2
Dynamic programming
3
Backtracking paradigm
4
More than one of the above
5
None of the above