All projects

Dijkstra's Shortest Path Finder

A C# implementation of Dijkstra's algorithm with Euclidean-weighted edges and a path comparison harness.

I wrote Dijkstra’s algorithm from scratch in C#, with Euclidean distances as edge weights, plus a small harness that compares the optimal paths across different graph configurations. I built it to understand the algorithm as much as to use it.

Get in touch

Have a research idea, a role, or a question about one of these projects?

There's also a contact form.