Skip to content
#

breadth-first-search

Here are 264 public repositories matching this topic...

It allows users to visualize the behavior of two popular pathfinding algorithms: A* (A-star) and BFS (Breadth-First Search). The tool features an intuitive graphical interface where users can interactively set up obstacles and start points, then watch in real-time as the algorithms calculate and display the shortest path.

  • Updated Aug 26, 2024
  • Python

This project is a graphical maze game implemented using Python and Tkinter. It allows users to generate random mazes. It features multiple pathfinding algorithms, including Depth-First Search (DFS), Breadth-First Search (BFS), Dijkstra's Algorithm, and the A* Algorithm

  • Updated Aug 18, 2024
  • Python
dsa

Improve this page

Add a description, image, and links to the breadth-first-search topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the breadth-first-search topic, visit your repo's landing page and select "manage topics."

Learn more