floyd, a C code which demonstrates Floyd's algorithm for finding the shortest distance between every pair of nodes in a directed graph.
The information on this web page is distributed under the MIT license.
floyd is available in a C version and a C++ version and a Fortran90 version and a MATLAB version and an Octave version and a Python version.
bellman_ford, a C code which implements the Bellman-Ford algorithm for finding the shortest distance from a given node to all other nodes in a directed graph whose edges have been assigned real-valued lengths.
cities, a Fortran90 library which handles various problems associated with a set of "cities" on a map.
cities, a dataset directory which contains a number of city distance datasets.
dijkstra, a C code which runs a simple example of Dijkstra's minimum distance algorithm for graphs.
graph_representation, a data directory which contains examples of ways of representing abstract mathematical graphs
subset, a C code which generates, ranks and unranks various combinatorial objects.
toms097, a C code which computes the distance between all pairs of nodes in a directed graph with weighted edges, using Floyd's algorithm.