**dijkstra_test**,
a FORTRAN90 code which
calls dijkstra(), which
implements a simple version of Dijkstra's algorithm for determining
the minimum distance from one node in a graph to all other nodes.

The computer code and data files described and made available on this web page are distributed under the MIT license

dijkstra, a FORTRAN90 code which implements a simple version of Dijkstra's minimum distance algorithm for graphs.

- dijkstra_test.sh, runs all the tests.
- dijkstra_test.txt, the output file.