Hacktoberfest 2025 — Get ready to ship
Fork, star, and open a PR to contribute and help others visualize algorithms.
Start the repoRegisterFind issues

Breadth-First Search (BFS)

Explore Graphs Level-by-Level to Find Shortest Paths

Time:O(V + E)
Space:O(V)
0123456

BFS Controls

Graph Editor (7/15 nodes)

💡 How to move nodes:

• Click and drag any node to reposition it

• Dragging is disabled during BFS execution

FastSlow

Vizit Bot

Learn algorithms with AI guidance

👋 Hey there! I'm Vizit Bot, your AI assistant for learning algorithms! I can help you understand how algorithms work, explain complexity analysis, guide you through the Vizit platform, and answer any CS questions. What would you like to learn today?
💡 Powered by Google Gemini • Ask about algorithms & CS concepts