Image:Complete network.svg

From Wikipedia, the free encyclopedia

Complete_network.svg‎ (SVG file, nominally 500 × 352 pixels, file size: 2 KB)

Wikimedia Commons logo This is a file from the Wikimedia Commons. The description on its description page there is shown below.
Commons is a freely licensed media file repository. You can help.

La bildo estas kopiita de wikipedia:en. La originala priskribo estas:

[edit] 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.

Vectorized by Mysid per cleanup request.

[edit] Licensing

I, the copyright holder of this work, have published or hereby publish it under the following license:
GNU head 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".

Aragonés | العربية | Asturianu | Български | বাংলা | ইমার ঠার/বিষ্ণুপ্রিয়া মণিপুরী | Brezhoneg | Bosanski | Català | Cebuano | Česky | Dansk | Deutsch | Ελληνικά | English | Esperanto | Español | Eesti | Euskara | فارسی | Suomi | Français | Gaeilge | Galego | עברית | Hrvatski | Magyar | Bahasa Indonesia | Ido | Íslenska | Italiano | 日本語 | ქართული | ភាសាខ្មែរ | 한국어 | Kurdî / كوردی | Latina | Lëtzebuergesch | Lietuvių | Bahasa Melayu | Nnapulitano | Nederlands | ‪Norsk (nynorsk)‬ | ‪Norsk (bokmål)‬ | Occitan | Polski | Português | Română | Русский | Slovenčina | Slovenščina | Shqip | Српски / Srpski | Svenska | తెలుగు | ไทย | Türkçe | Українська | اردو | Tiếng Việt | Volapük | Yorùbá | ‪中文(中国大陆)‬ | ‪中文(台灣)‬ | +/-
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)

[edit] Historio de la dosiero

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/TimeDimensionsUserComment
current15:17, 19 March 2006500×352 (2 KB)Maksim (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)
The following pages on the English Wikipedia link to this file (pages on other projects are not listed):