August 2018
Beginner
334 pages
10h 19m
English
We use the principles from DFS to traverse the graph. That is, we use a stack to store cells and add or remove them accordingly. We start by defining all the cells as walls, and then, from a random position, start taking them down. We repeat the process until we have traversed the whole graph.
Read now
Unlock full access