Abstract derivation of transitive closure algorithms

We state Warshall's algorithm in an abstract form and prove its correctness, while postponing the choices of representation. This is achieved by the use of relations and algebraic operations on relations, avoiding the use of vectors, matrix elements and indices. By choosing specific forms for the loop-body we derive Warshall's algorithm, the grid algorithm and generalisations of the latter. The derivation illustrates the point that nontrivial algorithms need not have difficult derivations, provided the right abstractions are chosen and provided the right notation is employed