Transitive closure according to Roy-Floyd-Warshall

Makarius Wenzel

May 23, 2014

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.


This formulation of the Roy-Floyd-Warshall algorithm for the transitive closure bypasses matrices and arrays, but uses a more direct mathematical model with adjacency functions for immediate predecessors and successors. This can be implemented efficiently in functional programming languages and is particularly adequate for sparse relations.


BSD License


Session Roy_Floyd_Warshall