Pathfinding Algorithms
Visualize how different pathfinding algorithms find paths through grids and graphs
Breadth-First Search (BFS)
Level-by-level exploration, optimal for unweighted graphs
Time Complexity: O(V + E)
Depth-First Search (DFS)
Deep exploration with backtracking
Time Complexity: O(V + E)
Dijkstra's Algorithm
Weighted shortest path with priority queue
Time Complexity: O((V + E) log V)
A* Search
Heuristic-guided optimal pathfinding using Manhattan distance
Time Complexity: O(E)
Greedy Best-First Search
Heuristic-only search (faster but not always optimal)
Time Complexity: O(E)
Bidirectional Search
Simultaneous search from both ends
Time Complexity: O(b^(d/2))
Lee Algorithm
Grid-based distance wave propagation
Time Complexity: O(V)