Bonafide pendejo.
BFS Visualizer
Breadth-First Search Visualizer
About the BFS Algorithm
Breadth-First Search (BFS) is a classic graph traversal algorithm used to explore all the nodes of a graph in the shortest path-first manner. It works by visiting each neighbor of a node before moving deeper into the graph. BFS guarantees finding the shortest path in an unweighted graph.
This visualizer demonstrates BFS in action on a grid-based layout. You can interact with the grid by setting a start point, a goal point, and adding walls to create obstacles. The algorithm explores nodes systematically and highlights its progress in real time.
Features:
- Interactive grid for dynamic pathfinding.
- Click and drag to create walls.
- Hold Shift and click to set the start point.
- Hold Ctrl and click to set the goal point.
- Visualization of explored nodes and the final shortest path.
- Ability to interrupt pathfinding and reset the grid.