Google Maps is unreasonably fast. Let me explain

Author / Site: Veritasium

Summary: This Veritasium video explores the mathematical and algorithmic principles behind how Google Maps computes routes so efficiently. It examines the graph-based representation of road networks and the optimization strategies that make real-time pathfinding feasible at massive scale. The video connects foundational graph theory to a widely recognized, high-impact real-world application.

Relevance to Module: Road networks are a canonical example of weighted graphs, making this video a natural bridge between abstract graph concepts covered in the module and real-world implementation. The video illustrates how graph traversal and pathfinding algorithms underpin tools students use every day, grounding the module's topics in practical context.

Pedagogical Purpose

This video serves primarily as motivation and real-world application framing, helping students achieve MO5 by illustrating how traversal and pathfinding strategies (related to BFS and DFS) are selected and justified based on problem constraints at scale. It also reinforces MO1 by demonstrating directed vs. undirected graph distinctions in the context of one-way streets and road networks, and supports MO2 by prompting students to think about why certain representations are chosen when graphs are extremely large and sparse, as road networks typically are.

Added July 10, 2026