Solved algorithms and data structures problems in many languages
LeetCode solutions
AI research environment for the game of Snake 🐍 .
breaking cycles in noisy hierarchies
Quantum computing > Algorithmic lattice surgery.
AI plays snake game using BFS (Breadth-First Search) algorithm.
This project is mainly about testing different path planning techniques in a certain world full of obstacles and how turtlebot3 managed to get to the goal position. It tackles 3 path planning technquies which are ( Artificial potential field (APF), Breadth first search (BFS), A*).
Algorithms and data structures implemented in Python
8 puzzle solver using BFS, DFS, IDDFS and A-star algorithm
WebSource Harvester is an educational web-source harvester that crawls a site (BFS, depth-controlled), downloads browser-visible assets (HTML, CSS, JS, images, fonts, PDFs), and rewrites paths so pages work offline, including nested routes. It enforces same-origin limits and is designed for learning, offline analysis, and safe portfolio demos.
Sokoban puzzle generator and solver with BFS, A* and Dijkstra
2D maze path solver visualizer implemented with python
path finding algorithms
Python Algorithms Package used in competitive programming
Using heuristic search Best-First and A* with BFS (with manhatan distance) methods to solve 8-puzzle
AI Puzzle Solver is a Python application that uses Pygame The main focus is on searching algorithms such as Depth-First Search, Breadth-First Search, A*, Uniform Cost Search, and others
Python code for finding Max Flow in a directed graph.
Visual implementation of BFS, DFS, and A* pathfinding algorithms — built on mobile with Python
Add a description, image, and links to the bfs topic page so that developers can more easily learn about it.
To associate your repository with the bfs topic, visit your repo's landing page and select "manage topics."