Pathfinding: BFS, DFS, Dijkstra, A*
Four algorithms explore the same grid. Draw walls, add costly terrain and compare the visited cells and the cost of the path.
English interface, partly translated: navigation, lab, projects, series, about and contact are; the home page sections, the site search and the content itself (articles, tutorials, research) are still in French.
7 demos
Demos that really compute: every figure is produced in your browser by the algorithm it explains. Change the parameters, observe, understand.
Four algorithms explore the same grid. Draw walls, add costly terrain and compare the visited cells and the cost of the path.