What is it?Warshall’s algorithm for computing the transitive closure of a Boolean matrix and Floyd-Warshall’s algorithm for minimum cost paths are both solutions to the more general Algebraic Path Problem. It describes the closure of a matrix (which may be a representation of a directed graph) using any semiring.
In this application, some algorithms and semirings are implemented which can be used to compute the general task or subproblems (as for example minimum cost paths), respectively. After having selected a particular algorithm and semiring, the user can enter some matrix and compute its closure. Alternatively, all intermediate steps may be computed to have a closer look on the algorithm’s behaviour.
The application is based on GTK 2.0 and is supposed to run on all systems having a port of this library although it is only tested on Windows (version 5.1, aka XP) and Solaris (version 9).
AppC is written and published under the GPL. A download link can be found below.
