Given two vertices in a graph s and t, which of the two traversals (BFS and DFS) can be used to find if there is path from s to t?
(A)
Only BFS
(B)
Only DFS
(C)
Both BFS and DFS
(D)
Neither BFS nor DFS
Answer: (C)
Explanation:
We can use both traversals to find if there is a path from s to t.
Hence Option(C) is the correct answer.
Quiz of this Question
Please comment below if you find anything wrong in the above post
Whether you’re preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape, neveropen Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we’ve already empowered, and we’re here to do the same for you. Don’t miss out – check it out now!
… [Trackback]
[…] Find More Info here on that Topic: geeksforgeeks.org/algorithms-graph-traversals-question-8/ […]
… [Trackback]
[…] Info to that Topic: geeksforgeeks.org/algorithms-graph-traversals-question-8/ […]
… [Trackback]
[…] Read More to that Topic: geeksforgeeks.org/algorithms-graph-traversals-question-8/ […]