Purely Functional, Simple, and Efficient Implementation of Prim and Dijkstra

Peter Lammich 🌐 and Tobias Nipkow 🌐

June 25, 2019

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.


We verify purely functional, simple and efficient implementations of Prim's and Dijkstra's algorithms. This constitutes the first verification of an executable and even efficient version of Prim's algorithm. This entry formalizes the second part of our ITP-2019 proof pearl Purely Functional, Simple and Efficient Priority Search Trees and Applications to Prim and Dijkstra.


BSD License


Session Prim_Dijkstra_Simple