Which of the following is true about DFS?

Practice Questions

1 question
Q1
Which of the following is true about DFS?
  1. It can be implemented using recursion
  2. It always finds the shortest path
  3. It uses a queue
  4. It is not suitable for cyclic graphs

Questions & Step-by-step Solutions

1 item
Q
Q: Which of the following is true about DFS?
Solution: DFS can be implemented using recursion, as it explores each branch of the graph until it reaches a leaf node.
Steps: 0

Related Questions

Soulshift Feedback ×

On a scale of 0–10, how likely are you to recommend The Soulshift Academy?

Not likely Very likely