Dijkstra Shortest Path

swMATH ID: 28550
Software Authors: Benedikt Nordhoff; Peter Lammich
Description: Dijkstra’s Shortest Path Algorithm. We implement and prove correct Dijkstra’s algorithm for the single source shortest path problem, conceived in 1956 by E. Dijkstra. The algorithm is implemented using the data refinement framework for monadic, nondeterministic programs. An efficient implementation is derived using data structures from the Isabelle Collection Framework.
Homepage: https://www.isa-afp.org/entries/Dijkstra_Shortest_Path.html
Dependencies: Isabelle
Related Software: Isabelle/HOL; Isabelle; HOL; Archive Formal Proofs; Separation Logic; Edmonds-Karp; Gabow SCC; Why3; CAVA LTL Modelchecker; Refinement Monadic; MLton; Isar; Coq; Fiat; Autoref; Locales; CeTA; BEEM; ACL2; Graph Theory
Cited in: 9 Publications

Citations by Year