ear in Mind

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.

A simple introduction to the Breadth-First Search (BFS) algorithm using Python. We’ll walk through the intuition, structure, and a working implementation with annotated code.