Transitive closure according to Roy-Floyd-Warshall

 

Title: Transitive closure according to Roy-Floyd-Warshall
Author: Makarius Wenzel
Submission date: 2014-05-23
Abstract: 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.
BibTeX:
@article{Roy_Floyd_Warshall-AFP,
  author  = {Makarius Wenzel},
  title   = {Transitive closure according to Roy-Floyd-Warshall},
  journal = {Archive of Formal Proofs},
  month   = may,
  year    = 2014,
  note    = {\url{http://isa-afp.org/entries/Roy_Floyd_Warshall.shtml},
            Formal proof development},
  ISSN    = {2150-914x},
}
License: BSD License