🏃

Graph Maze Escape

Intermediate

Generate a maze where each room or intersection is a node, and paths are edges. Player has to escape from the start node to the target node using the shortest or safest path.

20-25 min

🎯 Find the Shortest Path!

🧠 BFS Algorithm Live View

📋 Queue (FIFO)

Empty

✅ Visited Nodes

None

💡 Watch how BFS explores level by level using a queue!

Your path: A

Zoom:100%

🏃

Start

End

Your Path

BFS Path

🎮 How to Play

• Click on rooms to navigate through the maze

• Find the shortest path from Start (Red) to End (Orange)

• Your path will be highlighted in Blue

• Click "Check Path" when you reach the end

• Use "See BFS Solution" to watch the algorithm in action

💡 BFS Tips

Queue:Uses a queue (FIFO) to explore nodes

Level by Level:Explores all nodes at current depth first

Shortest Path:Guarantees shortest path in unweighted graphs

Memory:Uses more memory but finds optimal solution

🌍 Real-world Uses

• GPS navigation systems

• Social network friend suggestions

• Web crawlers for search engines

• Network routing protocols