NYRCS Set 8 (Intro to GT - BFS) (0/500)

Feel free to refer to the method in the slides and re-implement. I would strongly discourage copying the code straight when you are a beginner. You should instead understand why it is and be able to implement it from scratch. Referring a bit is ok as long as you really understand and learn. Hint: Use the lecture slides :) Hint2: Splithunny and milkweed are graphs but instead of using an adjacency list you iterate through all neighbours on the grid.