Pathfinding Algorithms

Master graph traversal and shortest path algorithms through interactive visualizations of mazes, grids, and search strategies

Part 1

Foundations

The building blocks of graph traversal

01

What is a Graph?

Understanding graphs, nodes, and edges

02

Breadth-First Search

Exploring level by level

03

Depth-First Search

Exploring as deep as possible first

04

Generating Mazes

Creating interesting pathfinding challenges

Part 2

Weighted Paths

Finding optimal routes when costs matter

05

Weighted Graphs and Costs

When not all edges are equal

06

Dijkstra's Algorithm

The classic shortest path algorithm

07

Heuristics and Informed Search

Using knowledge to search smarter

08

A* Algorithm

Combining best-first search with optimal paths

Part 3

Comparisons and Trade-offs

Understanding when to use which algorithm

09

Comparing Algorithms

Performance, guarantees, and trade-offs

10

When Algorithms Fail

Edge cases and limitations

Part 4

Beyond the Basics

Advanced techniques and real-world applications

11

Advanced Techniques

Jump point search, bidirectional search, and more

12

Real-World Applications

From game AI to GPS navigation