FAQ: Graphs: Python - Building the Vertex

This community-built FAQ covers the “Building the Vertex” exercise from the lesson “Graphs: Python”.

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

Computer Science

Complex Data Structures

FAQs on the exercise Building the Vertex

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!

Could anyone explain to me why in the solution code for get_edges() they use “return list(self.edges.keys())” instead of “return list(self.edges)” ? As far as I’ve understood, by calling list() alone would already get only the key of a dictionary?


It wouldn’t because it would return the list version of the whole self.edges dictionary(not just the keys, the values also). You should understand that returning a dictionary return not just the keys but also the values.

Hey! why are we using dictionary to store edges does it make any difference if a use list instead of dictionary