Skip to content

Visualization of algorithms like BFS, DFS, GBFS, Dijkstra and A_Star(A*)

Notifications You must be signed in to change notification settings

killpop3770/pathfinders

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

33 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Pathfinders

The project is a simple visualization of algorithms such as:

  • Breadth first search
  • Depth first search
  • Greedy best first search
  • Dijkstra
  • A_Star

Latest Version

Build and Run

First, make sure the following are installed:

  1. Rust 🦀

In order to build, first clone the github repo:

git clone https://github.com/killpop3770/pathfinder_a_star
cd pathfinder_a_star

Then run:

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

  • minimal viable product
  • make gradient for cell cost
  • make one/two default map/maze for all algorithms
  • handle error from threads

Acknowledgements

About

Visualization of algorithms like BFS, DFS, GBFS, Dijkstra and A_Star(A*)

Topics

Resources

Stars

Watchers

Forks

Packages

No packages published

Languages