TEC-Bridge Logo

Breadth-First Search (BFS) Visualizer

STEM Interactive Visual Learning Program at TEC-Bridge AI

Setup Graph

BFS Controls

Graph Visualization

Colors: Green = Start, Yellow = Current, Blue = Visited, Orange = Queued

Queue

Algorithm Steps

How to Use

  1. Setup: Click "Sample Graph" or "Random Graph" to create a graph
  2. Start Node: Enter the starting node (e.g., A, B, C) and click "Start BFS"
  3. Step Through: Click "Next Step" to see each step of the BFS execution
  4. Run Through: Click "Run Through" to automatically execute all steps
  5. Observe: Watch nodes change colors and the queue update as BFS progresses
  6. Reset: Click "Reset" to start over with a new search

BFS Concept

Breadth-First Search (BFS) is a graph traversal algorithm that explores nodes level by level, visiting all neighbors before moving deeper.

How it works:

  • Start with a node and add it to the queue
  • Mark the current node as visited
  • Add all unvisited neighbors to the queue
  • Remove the front node from queue and repeat
  • Continue until queue is empty
  • Guarantees shortest path in unweighted graphs

Time Complexity: O(V + E) where V = vertices, E = edges

Breadth-First Search Code Implementation

Rate This Learning Tool

Clarity of Visualization:
★ ★ ★ ★ ★
Interactivity:
★ ★ ★ ★ ★
Educational Value:
★ ★ ★ ★ ★
Performance:
★ ★ ★ ★ ★
Intuitivity & Usability:
★ ★ ★ ★ ★
Overall Evaluation:
★ ★ ★ ★ ★

© 2025 TEC-Bridge AI. All rights reserved. | Contact: contact@tec-bridge.ai | https://tec-bridge.ai