BFS or DFS - Graph / Introduction

Following is true only when recursion is used in DFS and not external stack “uses less memory than BFS for wide graphs, since BFS has to keep all the nodes in the queue, and for wide graphs this can be quite large”

it’s still true for external stack cuz the point is for wide graph DFS goes deep so it doesn’t store the full ‘width’ of the graph