File:Prim's algorithm.svg
Jump to navigation
Jump to search
Size of this PNG preview of this SVG file: 152 × 597 pixels. Other resolutions: 61 × 240 pixels | 122 × 480 pixels | 195 × 768 pixels | 260 × 1,024 pixels | 521 × 2,048 pixels | 266 × 1,045 pixels.
Original file (SVG file, nominally 266 × 1,045 pixels, file size: 39 KB)
Captions
Captions
Add a one-line explanation of what this file represents
Summary
[edit]
| Description |
English: Demonstration of Prim's algorithm, starting at the vertex A. Tree edges are highlighted in red, candidates for the next edge are in black, and non-candidates are in grey. The set of vertices joined to the tree so far is in black, while those not yet joined are in grey. The algorithm starts by choosing the cheapest edge out of A, then choosing the cheapest edge between {A,D} and {B,C} (there are two of weight 2, and BD is chosen arbitrarily). In the next step the edge AB is no longer a candidate because it now joins two nodes already in the tree, and the only edge remaining to be added is CD. |
| Date | |
| Source | Own work |
| Author | User:Dcoetzee |
Licensing
[edit]
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 | 02:08, 16 November 2013 | | 266 × 1,045 (39 KB) | Dcoetzee (talk | contribs) | Make circle of grey nodes grey also |
| 02:06, 16 November 2013 |  | 266 × 1,045 (39 KB) | Dcoetzee (talk | contribs) | {{Information |Description ={{en|1=Demonstration of Prim's algorithm, starting at the vertex A. Tree edges are highlighted in red, candidates for the next edge are in black, and non-candidates are in grey. The set of vertices joined to the tree so f... |
You cannot overwrite this file.
File usage on Commons
The following page uses this file:
File usage on other wikis
The following other wikis use this file:
- Usage on ar.wikipedia.org
- Usage on en.wikipedia.org
- Usage on fr.wikipedia.org
