Algorithms Lab

Master pathfinding algorithms through interactive visualization and challenges

Configuration
25%

Algorithm


BFS

DFS

Dijkstra

A*
Start
Goal
Wall
Visited
Path
Frontier
Visualization
Slow Fast

Algorithm Statistics

0
Cells Visited
0
Path Length
0
Current Step
0
Total Steps
Learn & Test

BFS (Breadth-First Search)

BFS explores all nodes at the present depth before moving to nodes at the next depth level. It uses a queue (FIFO) data structure and guarantees the shortest path in unweighted graphs.

Time Complexity: O(V + E)
Space Complexity: O(V)
Optimal: Yes (unweighted)
Complete: Yes

Quiz Mode

Run an algorithm to generate quiz questions based on the results!

Score: 0

Answer quiz questions correctly to earn points and master pathfinding algorithms!