FAQ: Graph Search: Conceptual - Depth-First Search (DFS) Conceptual

Frequently Asked Questions Python FAQ
1

Community%20FAQs%20on%20Codecademy%20Exercises
Community%20FAQs%20on%20Codecademy%20Exercises1000×208 141 KB

This community-built FAQ covers the “Depth-First Search (DFS) Conceptual” exercise from the lesson “Graph Search: Conceptual”.

Paths and Courses
This exercise can be found in the following Codecademy content:

FAQs on the exercise Depth-First Search (DFS) Conceptual

There are currently no frequently asked questions associated with this exercise – that’s where you come in! You can contribute to this section by offering your own questions, answers, or clarifications on this exercise. Ask or answer a question by clicking reply (reply) below.

If you’ve had an “aha” moment about the concepts, formatting, syntax, or anything else with this exercise, consider sharing those insights! Teaching others and answering their questions is one of the best ways to learn and stay sharp.

Join the Discussion. Help a fellow learner on their journey.

Ask or answer a question about this exercise by clicking reply (reply) below!

Agree with a comment or answer? Like (like) to up-vote the contribution!

Need broader help or resources? Head here.

Looking for motivation to keep learning? Join our wider discussions.

Learn more about how to use this guide.

Found a bug? Report it!

Have a question about your account or billing? Reach out to our customer support team!

None of the above? Find out where to ask other questions here!

2

The Question: Take a look at the maze below. How could you use DFS to find one or all of the solutions to the maze?

To be honest I am assuming you’re either the blue dot or the red dot and you’re trying to meet the other dot… It seems to me though maybe because I’m having me a day there is only one solution to the maze not multiple paths?!..

DFS would determine if the maze is in fact even a solveable maze? We’re supposed to assume the maze from the wording has multiple solutions when this is just not the case… The maze is in this case isn’t such a maze it has a singular correct answer like the sudoku reference the academy makes. Possibly… to answer the question fully Dijkstra’s Algo. would be the best possible solution to a more complex maze with multiple solutions.

1 Like
3

The Question: Take a look at the maze below. How could you use DFS to find one or all of the solutions to the maze?

I would map this maze to x,y coordinates. Each intersection in the maze would be a vertex(x,y ; dot to look for : True or False), apply the logic of the DFS, check each intersection aka vertex to verify if it has the dot, if not, move to another vertex/coordinates.
Maybe to “influence” the choice of the next vertex to check, the coordinates could act like a filter.

This DFS algo make me think about a “brute force” way of thinking.