Kruskal's Algorithm for Minimum Spanning Forest (Q7361009)
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 Kruskal
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Kruskal's Algorithm for Minimum Spanning Forest |
AFP entry Kruskal |
Statements
14 February 2019
0 references
Maximilian P. L. Haslbeck
0 references
Peter Lammich
0 references
Julian Biendarra
0 references
Kruskal's Algorithm for Minimum Spanning Forest (English)
0 references
This Isabelle/HOL formalization defines a greedy algorithm for finding a minimum weight basis on a weighted matroid and proves its correctness. This algorithm is an abstract version of Kruskal's algorithm. We interpret the abstract algorithm for the cycle matroid (i.e. forests in a graph) and refine it to imperative executable code using an efficient union-find data structure. Our formalization can be instantiated for different graph representations. We provide instantiations for undirected graphs and symmetric directed graphs.
0 references
