ear in Mind

This is Episode 1 of a journey through some not-so-often-used python modules. We start with heapq and see what we can use it for.

A gentle introduction to Dijkstra algorithm for computing shortest paths on weighted graphs. We'll explore the intuition, the data structures behind it, and a clean Python implementation.