FAQ: Dijkstra's Algorithm: Python - Understanding Heapq

This community-built FAQ covers the “Understanding Heapq” 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 Understanding Heapq

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!

1 Like

It’s fixed. Thank you******

The while loop must never close, I let the IDE (or whatever it is) load, five minutes passed and it never stopped and would not pass the instruction. So now i’m stuck there, I’ve got until the 19th to finish the computer science path, please either tell me how to break out of the while loop while still passing the instruction or fix it. Thank you

here’s the code that was already in the file:

#Write Import Statement here
#only thing I added was the import, also un-commented and ran like it told me to.
import heapq

heap = [(0, 'A')]
heapq.heappush(heap, (1, 'B'))
heapq.heappush(heap, (-5, 'D'))
heapq.heappush(heap, (4, 'E'))
heapq.heappush(heap, (2, 'C'))

print("The smallest values in the heap in ascending order are:\n")
while heap:

Screenshot shows what it sticks at (spinning load circle)

Still spinning lol (20 minutes)