🗺 Pathfinding Visualizer

An interactive platform to visualize Dijkstra’s algorithm.

Dijkstra’s Algorithm


As found on the web, Dijkstra’s algorithm to find the shortest path between a and b. It picks the unvisited vertex with the lowest distance, calculates the distance through it to each unvisited neighbor, and updates the neighbor’s distance if smaller.

Inspired by Clement M.

Written in TypeScript & React with ❤️ by @FilippoFonseca.


View Github