Python ProgrammingMediumHigh School (11–12)High School (9–10)UndergraduateGeneralPython Going Further › Data Structures
Reachable places
Write a search that finds everything that can be reached in a graph. The checker uses a graph with loops and separate groups.
Contributed by StemPy Labpython
Loading Python runtime…
A worked solution
Have you tried it?
Do the tasks in the editor first, and run the checker after each one. Its hints help when a check fails. When you are ready, compare your code with this solution.
Discussion (0)
Log in to join the discussion.
Loading…