Question:medium

Which algorithm design strategy is used to find single source shortest paths?

Show Hint

Dijkstra's Algorithm \[ \Longrightarrow \] Greedy Strategy Bellman-Ford \[ \Longrightarrow \] Dynamic Relaxation Method
Updated On: Jun 25, 2026
  • Divide and Conquer
  • Divide and Merge
  • Greedy Approach
  • Branch and Bound
Show Solution

The Correct Option is C

Solution and Explanation

Was this answer helpful?
0