A Python implementation and visualization of various pathfinding and graph search algorithms.
-
Updated
Mar 3, 2024 - Python
A Python implementation and visualization of various pathfinding and graph search algorithms.
Maze generation and path-finding algorithm visualiser using React.js.
A servant robot trying to serve as fast as possible using A* algorithm.
🛰️ Real-world navigation based on open source spatial data and pathfinding algorithms
Convert any image into map and find the shortest path from source to destination. Supported Material You, Dynamic Theming. Mapify Limitless!
All solutions to the problems in the "Graph Theory I" study plan on LeetCode.
A pathfinding visualizer for different pathfinding algorithms
This project was created to demonstrate various path finding and maze generation algorithms.
Shortest path finder for VK social graph using Go, VK API, and bidirectional BFS.
A pathfinding robot operating based on IDS, bidirectional BFS, and A-star search algorithms.
n-tile puzzle solver using bidirectional search
A Wikipedia pathfinding engine with bidirectional BFS and live graph visualization.
A distributed client-server application built with Java RMI that computes the shortest path between nodes in a dynamic, directed graph under concurrent workloads.
purely function rest app using http4s, skunk, and cats-effect
RubiX is an advanced Rubik's Cube solver combining Deep Reinforcement Learning (PPO) with classical group theory (Kociemba's Algorithm). Features a stunning 3D Three.js interface, a high-speed FastAPI backend, and a hybrid solver that guarantees a solution for any valid cube in under 200ms. Tested with a 100% mathematical success rate.
Add a description, image, and links to the bidirectional-bfs topic page so that developers can more easily learn about it.
To associate your repository with the bidirectional-bfs topic, visit your repo's landing page and select "manage topics."