Implementation of path finding algorithms

S - start point
E - end point
@ - path
# - obstacle
1 - cost

manhattan vs euclidean heuristic distance

finds the cheapest path (. is 1 by default)

in some cases B* can't find the shortest path, A* always finds the shortest or cheapest path

Name		Name	Last commit message	Last commit date
Latest commit History 5 Commits
screenshots		screenshots
.gitignore		.gitignore
README.md		README.md
a_star.py		a_star.py
b_star.py		b_star.py
bfs.py		bfs.py
dijkstra.py		dijkstra.py
flood_fill.py		flood_fill.py
grid_helper.py		grid_helper.py

Provide feedback