Tatenda Mawango

Engineering · 2023

Dijkstra's Shortest Path Finder

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

Source on GitHub

A from-scratch Dijkstra implementation in C# with Euclidean edge weights, plus a small harness for comparing optimal paths across different graph configurations. Built as much for understanding the algorithm as for using it.