Abstract
A calculational derivation is given of an abstract path algorithm, one instance of the algorithm being Dijkstra’s shortest-path algorithm, another being breadth-first/depth-first search of a directed graph. The basis for the derivation is the algebra of regular languages.
Cite
CITATION STYLE
APA
Backhouse, R. C., & van Gasteren, A. J. M. (1993). Calculating a path algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 669 LNCS, pp. 32–44). Springer Verlag. https://doi.org/10.1007/3-540-56625-2_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free