FAQ: Graph Search: Python - A Breadth of Fresh Neighbors

This community-built FAQ covers the “A Breadth of Fresh Neighbors” exercise from the lesson “Graph Search: Python”.

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

FAQs on the exercise A Breadth of Fresh Neighbors

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!

Hello Codecademy Team, I am finding it difficult to implement DFS and BFS algorithms.
I implemented it but I don’t know what my code does.
Can u please add video at the end of instructions. so that students like me will be able to grasp difficult concepts quickly.

7 Likes

Seconded.

Looking up BFS on other sites, theirs is far more simple and easy to follow. You simply populate and then depopulate the queue.

This algorithm uses a vertex and path list to build a path and a queue and I am very, very lost.

1 Like

Hello. It’d be nice if this exercise didn’t refuse to accept “if not neighbor in visited:” as opposed to “if neighbor not in visited:” when they are the exact same thing :expressionless: Especially since I’m 99% sure I did it that way on the previous one and it did accept it.

I’m not an expert, but I think there IS a difference between the two expressions. When you code not neighbor in visited, you may be saying: "When the value which isn’t None, (or when it’s None, I’m not sure), is in visited.

Totally agreed! I finished the section but don’t feel like I understood it completely although I went through it very slowly in 3 hours. I have to check via other sites to fully understand it.