File:Complete network.svg
Transferred from en.wikipedia to Commons by Maksim.
The original description page was here. All following user names refer to en.wikipedia.
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 find the shortest distance (spanning tree) connecting each point, or vertex.
Category:Invalid SVG created with CorelDRAW:Diagrams#1000Complete%20network.svgCategory:Translation possible - SVGCategory:Translation possible - SVG
Vectorization: Mysid per cleanup request.
Licensing
I, the copyright holder of this work, hereby publish it under the following license:
![]() |
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. |
![]() ![]() ![]() |
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. |
Mysid per cleanup request.
Licensing
I, the copyright holder of this work, hereby publish it under the following license:
![]() |
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. |
![]() ![]() ![]() |
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. |
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
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)
Category:CC-BY-SA-3.0-migrated
Category:Files with no machine-readable author
Category:Files with no machine-readable source
Category:GFDL
Category:Invalid SVG created with CorelDRAW:Diagrams
Category:Kruskal's algorithm
Category:License migration completed
Category:Media missing infobox template
Category:Self-published work
Category:Translation possible - SVG
Category:Undirected graphs