Teaching TN TRB CS Mock Test Algorithms Graphs/Spanning Tree and Shortest Paths Shortest Paths

Dijkstra’s shortest path algorithm is based on

1
Divide and conquer
2
Greedy algorithm
3
Dynamic Programming
4
Backtracking
Share: WhatsApp Telegram X

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