- Dijkstra's algorithm
- Traverses through the available nodes keeping track of the distance to every node until it reaches the target node or has gone through all the available nodes
- Creates a path back from the target node to the starter node based on the stored distances
- A* search algorithm
- Maintains a tree of paths originating from the starter node
- Extends the tree one edge at a time choosing next node based on heuristics until it reaches the target node or has gone through all the available nodes
git clone git@github.com:17ms/visual-pathfinder.git
cd visual-pathfinder
sudo apt install python3-tk
mkvirtualenv visual-pathfinder
pip3 install -r requirements.txt
chmod +x src/main.py
./src/main.py
