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

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters