This repository is a JavaScript Visualizer for the popular pathfinding problem found here : https://en.wikipedia.org/wiki/Pathfinding 
Web Interface : https://r-besson.github.io/pathfinding.js/ 
A* : https://en.wikipedia.org/wiki/A*_search_algorithm 
Dijkstra : https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm 
DFS : https://en.wikipedia.org/wiki/Depth-first_search 
BFS : https://en.wikipedia.org/wiki/Breadth-first_search 
Greedy BFS : https://en.wikipedia.org/wiki/Best-first_search 
You can also select the distance type heuristic. (e.g Euclidean, Chebyshev, etc ...) 
Some can be found here : http://theory.stanford.edu/~amitp/GameProgramming/Heuristics.html
Example Picture: 
