FAQ: Dijkstra's Algorithm: Python - Initializing Dijkstra's Algorithm

This community-built FAQ covers the “Initializing Dijkstra’s Algorithm” exercise from the lesson “Dijkstra’s Algorithm: Python”.

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

Computer Science

FAQs on the exercise Initializing Dijkstra’s Algorithm

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!

For anyone having problems grasping this algorithm:

Djikstras Algorithm by Computerphile

I found this course much easier because I had already seen the video above some time ago. A followup video talks about A* and the one after that using these algorithms in a maze solver, also providing a link to a Github-Repo providing the python code for reference.

Have fun coding! :slight_smile:

1 Like

vertices_to_explore = [(0, start)]

Can anyone tell me how this portion of the code works? I’m having trouble figuring it out.