On sorting, heaps, and minimum spanning trees (Q973020)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On sorting, heaps, and minimum spanning trees |
scientific article; zbMATH DE number 5713402
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On sorting, heaps, and minimum spanning trees |
scientific article; zbMATH DE number 5713402 |
Statements
On sorting, heaps, and minimum spanning trees (English)
0 references
28 May 2010
0 references
Kruskal's MST algorithm
0 references
Prim's MST algorithm
0 references
incremental sorting
0 references
priority queues
0 references
external priority queues
0 references
0 references
0 references
0.87400055
0 references
0.8735108
0 references
0 references
0 references
0 references
