spaths

A fast, self-contained, C99 implementation of the Dijkstra shortest paths algorithm

To build:

$ make

To solve the included example rome99 and compute the time of 1000 executions:

 ./dijkstra ./data/rome99.gr 1000