https://github.com/killpop3770/pathfinders
Visualization of algorithms like BFS, DFS, GBFS, Dijkstra and A_Star(A*)
https://github.com/killpop3770/pathfinders
astar bfs dfs dijkstra gbfs pathfinding visualization
Last synced: 3 months ago
JSON representation
Visualization of algorithms like BFS, DFS, GBFS, Dijkstra and A_Star(A*)
- Host: GitHub
- URL: https://github.com/killpop3770/pathfinders
- Owner: killpop3770
- Created: 2024-07-25T16:37:17.000Z (10 months ago)
- Default Branch: main
- Last Pushed: 2024-08-17T12:34:35.000Z (10 months ago)
- Last Synced: 2024-08-17T13:41:27.042Z (10 months ago)
- Topics: astar, bfs, dfs, dijkstra, gbfs, pathfinding, visualization
- Language: Rust
- Homepage:
- Size: 1.04 MB
- Stars: 2
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Pathfinders
The project is a simple visualization of algorithms such as:
- Breadth first search
- Depth first search
- Greedy best first search
- Dijkstra
- A_Star![]()
![]()
---
[](https://github.com/killpop3770/pathfinders)
## Build and Run
First, make sure the following are installed:
1. [Rust](https://www.rust-lang.org/tools/install) 🦀
In order to build, first clone the github repo:
```sh
git clone https://github.com/killpop3770/pathfinder_a_star
cd pathfinder_a_star
```Then run:
```sh
cargo build && cargo run
```## Hints
The control is carried out with the mouse or:
- Keys 1-5 to call algorithm
- "Esc" key to return to the main menu## TODO
- [x] minimal viable product
- [ ] make gradient for cell cost
- [ ] make one/two default map/maze for all algorithms
- [ ] handle error from threads## Acknowledgements
- [piston_window](https://github.com/PistonDevelopers/piston_window)