File:Complete network.svg
Original file (SVG file, nominally 500 × 352 pixels, file size: 2 KB)
Captions
Transferred from en.wikipedia to Commons by Maksim.
Summary
[edit]Caption in Kruskal's algorithm: An example of a complete network. Each dot is a vertex, and can be turned into a tree on its own. Use the Kruskal's algorithm to find the shortest distance (spanning tree) connecting each point, or vertex.
Vectorization: Mysid per cleanup request.
Licensing
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled GNU Free Documentation License.http://www.gnu.org/copyleft/fdl.htmlGFDLGNU Free Documentation Licensetruetrue |
This file is licensed under the Creative Commons Attribution-Share Alike 3.0 Unported license. | ||
| ||
This licensing tag was added to this file as part of the GFDL licensing update.http://creativecommons.org/licenses/by-sa/3.0/CC BY-SA 3.0Creative Commons Attribution-Share Alike 3.0truetrue |
Mysid per cleanup request.
Licensing
[edit]Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled GNU Free Documentation License.http://www.gnu.org/copyleft/fdl.htmlGFDLGNU Free Documentation Licensetruetrue |
This file is licensed under the Creative Commons Attribution-Share Alike 3.0 Unported license. | ||
| ||
This licensing tag was added to this file as part of the GFDL licensing update.http://creativecommons.org/licenses/by-sa/3.0/CC BY-SA 3.0Creative Commons Attribution-Share Alike 3.0truetrue |
date/time | username | edit summary |
---|---|---|
13:37, 23 October 2005 | en:User:Robchurch | (<span class="autocomment"><a href="/wiki/Image:Complete_network.svg#Summary" title="Image:Complete network.svg">→</a>Summary</span>) |
13:22, 18 October 2005 | en:User:Mysid | (A cleaned-up version of <a href="/w/index.php?title=Image:Algorithm.JPG&action=edit" class="new" title="Image:Algorithm.JPG">:Image:Algorithm.JPG</a>, originally by Matt Wardill (<a href="/wiki/User:Jax_Omen" title="User:Jax Omen">User:Jax Omen</a>). Caption in <a href="/wiki/Kruskal%27s_algorithm" title="Kruskal's algorithm">Kruskal's algorithm</a>: ''An example of a complete network. Each dot is a vertex, and can be turned into a tree on its own. Use the Kruskal's alg) |
Original upload log
[edit]Legend: (cur) = this is the current file, (del) = delete this old version, (rev) = revert to this old version.
Click on date to download the file or see the image uploaded on that date.
- (del) (cur) 13:22, 18 October 2005 . . en:User:Mysid Mysid ( en:User_talk:Mysid Talk) . . 500x352 (1806 bytes) (A cleaned-up version of :Image:Algorithm.JPG, originally by Matt Wardill ( en:User:Jax_Omen User:Jax Omen). Caption in en:Kruskal's_algorithm Kruskal's algorithm: An example of a complete network. Each dot is a vertex, and can be turned into a tree on its own. Use the Kruskal's alg)
File history
Click on a date/time to view the file as it appeared at that time.
Date/Time | Thumbnail | Dimensions | User | Comment | |
---|---|---|---|---|---|
current | 15:17, 19 March 2006 | 500 × 352 (2 KB) | Maksim (talk | contribs) | La bildo estas kopiita de wikipedia:en. La originala priskribo estas: == Summary == Caption in Kruskal's algorithm: ''An example of a complete network. Each dot is a vertex, and can be turned into a tree on its own. Use the Kruskal's algorithm to fin |
You cannot overwrite this file.
File usage on Commons
There are no pages that use this file.
File usage on other wikis
The following other wikis use this file:
- Usage on cs.wikipedia.org
- Usage on de.wikipedia.org
- Usage on en.wikipedia.org