Calculating path algorithms

R.C. Backhouse, J.P.H.W. van den Eijnde, A.J.M. Gasteren, van

Research output: Contribution to journalArticleAcademicpeer-review

16 Citations (Scopus)


A calculational derivation is given of two abstract path algorithms. The first is an all-pairs algorithm, two well-known instances of which are Warshall's (reachability) algorithm and Floyd's shortest-path algorithm; instances of the second are Dijkstra's shortest-path algorithm and breadth-first/depth-first search of a directed graph. The basis for the derivations is the algebra of regular languages.
Original languageEnglish
Pages (from-to)3-19
JournalScience of Computer Programming
Issue number1-2
Publication statusPublished - 1994


Dive into the research topics of 'Calculating path algorithms'. Together they form a unique fingerprint.

Cite this