Grokking Graph Algorithms for Coding Interviews
Ask Author
Back to course home

0% completed

Vote For New Content
This article can be extended by elaborating that BFS and DFS are both viable solutions for the problem

Mikhail Putilov

May 20, 2023

I stumbled upon on different sources that DFS as well can be used to solve this task. I can't say how important that is, but it seems that it is important. At least, reading the article gives an intuition that only BFS is the viable approach.

0

0

Comments
Comments

On this page