Path Finder Path finding visualisation using javascrip. Introduction The aim of this project is to visualisate basic path-finder algorithms. Currently available: BFS Greedy BFS (manhattan and euclidean heuristics) A* (manhattan and euclidean heuristics) Examples BFS: Greedy BFS, manhattan heuristic: Greedy BFS, euclidean heuristic: A*, manhattan heuristic: A*, euclidean heuristic: