| Display title | Borůvka's algorithm |
| Default sort key | Borůvka's algorithm |
| Page length (in bytes) | 11,258 |
| Namespace ID | 0 |
| Page ID | 197253 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | 57 |
| Number of page watchers who visited in the last 30 days | 6 |
| Number of redirects to this page | 7 |
| Counted as a content page | Yes |
| Wikidata item ID | Q1468211 |
| Local description | Method for finding minimum spanning trees |
| Central description | algorithm for finding minimum spanning trees by repeatedly finding the shortest edge out of each subtree in a forest and adding all such edges to the forest |
| Page image |  |
| Page views in the past 30 days | |
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
| Page creator | 62.179.55.206 (talk) |
| Date of page creation | 13:20, 16 March 2003 |
| Latest editor | Patrick Welsh (talk | contribs) |
| Date of latest edit | 14:54, 27 March 2025 |
| Total number of edits | 204 |
| Recent number of edits (within past 30 days) | 0 |
| Recent number of distinct authors | 0 |
| Hidden categories (6) | This page is a member of 6 hidden categories (help):
|
| Transcluded templates (50) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | |
_Anim.gif?lang=en)