Shortest path algorithms sit at the heart of modern graph theory and many of the systems that move people, data, and goods around the world. After nearly seventy years of relying on the same classic ...

I need to figure out how to find the shortest path between two vertices in an adjacency matrix representation of an undirected graph. I get the impression that I'm supposed to use Dijkstra's ...

A header-only C++ implementation of the single-source shortest path (SSSP) algorithm for sparse directed graphs with non-negative weights, based on the 2025 paper by Duan et al. This algorithm is ...

This project implements a navigation system for the city of Madrid using Graph Theory and shortest path algorithms. Developed as a university project for Discrete Mathematics, with my colleage Pablo ...