3
votes
Breadth-first search implementation for finding edge of grid c++
Tests
Some automated testing lets people have confidence in changing the code. Tests are also definition of correctness - without tests it is hard to understand what is the intended behavior of the ...
1
vote
Order of values in dfs and bfs
Visited?
What is the point of visited=None in your function signatures? It looks like you're setting up for a recursive call, where the standard caller doesn't ...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
breadth-first-search × 180graph × 56
python × 54
algorithm × 50
c++ × 39
java × 37
performance × 33
depth-first-search × 32
tree × 25
programming-challenge × 22
python-3.x × 21
pathfinding × 21
c# × 20
javascript × 11
time-limit-exceeded × 10
interview-questions × 7
object-oriented × 6
haskell × 6
c++11 × 5
queue × 5
memory-optimization × 5
sliding-tile-puzzle × 5
beginner × 4
c × 4
python-2.x × 4