File:Prim's algorithm proof.svg
Jump to navigation
Jump to search
Size of this PNG preview of this SVG file: 293 × 598 pixels.
Original file (SVG file, nominally 405 × 827 pixels, file size: 31 KB)
Summary
| Description |
English: Diagram to assist in proof of Prim's algorithm. If is a minimum spanning tree, and Y is the tree found by Prim's algorithm, we find e, the first edge added by the algorithm which is in but not in Y. Let V be the vertices added to the tree up to that point. Then we find a path in between the endpoints of e and find an edge f in that path with one endpoint in V. Then is also a minimum spanning tree, and is in this case equal to Y. In general, more steps may be needed. |
| Date | |
| Source | Own work |
| Author | User:Dcoetzee |
Licensing
I, the copyright holder of this work, hereby publish it under the following license:
 
|
This file is made available under the Creative Commons CC0 1.0 Universal Public Domain Dedication. |
| The person who associated a work with this deed has dedicated the work to the public domain by waiving all of their rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law. You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
|
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 08:03, 15 November 2013 | No thumbnail | 405 × 827 (31 KB) | commonswiki>Dcoetzee | {{Information |Description ={{en|1=Diagram to assist in proof of Prim's algorithm. If <math>Y_1</math> is a minimum spanning tree, and Y is the tree found by Prim's algorithm, we find ''e'', the first edge added by the algorithm which is in <math>Y_... |
File usage
There are no pages that use this file.
