Recently, I was approached by a company looking for a fast, visual way to calculate the shortest path between connected nodes — something they could eventually use to improve flowchart and diagram tooling.
To explore this idea, I built an interactive Dijkstra pathfinding tool in the browser using TypeScript and the Canvas API. It lets you drag around two points, and it dynamically calculates the shortest orthogonal path in real-time using Dijkstra’s algorithm.
This project helped me deeply understand the algorithm’s mechanics and also prototype how a visual, grid-based layout engine might work in production tools.
Top comments (0)