Purely Functional, Simple, and Efficient Implementation of Prim and Dijkstra (Q7361137)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
AFP entry Prim_Dijkstra_Simple
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Purely Functional, Simple, and Efficient Implementation of Prim and Dijkstra |
AFP entry Prim_Dijkstra_Simple |
Statements
25 June 2019
0 references
Peter Lammich
0 references
Tobias Nipkow
0 references
Purely Functional, Simple, and Efficient Implementation of Prim and Dijkstra (English)
0 references
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 .
0 references
0 references
