Image:Minimum spanning tree.svg

From Wikipedia, the free encyclopedia

Minimum_spanning_tree.svg (SVG file, nominally 300 × 242 pixels, file size: 15 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.

[edit] Summary

Español: Un ejemplo de árbol expandido mínimo. Cada punto representa un vértice, el cual puede ser un árbol por sí mismo. Se usa el Algoritmo para buscar las distancias más cortas (árbol expandido) que conectan todos los puntos o vértices.

SVG version of Image:Minimum spanning tree.png based on same original source. Original description follows.

Diagram of a minimum spanning tree. Each edge is weighted with a number roughly equal to its length. Dark, thick edges are in the minimum spanning tree. Created by Derrick Coetzee in Mathematica and Adobe Illustrator and Photoshop. I grant this work into the public domain and release all rights to it.

Some technical details: the graph is actually the Delaunay triangulation of the set of 10 points, which were chosen randomly, and the minimum spanning tree here also happens to be the Euclidean minimum spanning tree of this set of points. I chose the graph this way because the Delaunay triangulation is planar (crossing edges makes for messier diagrams) and because it has big angles (sliver angles make it hard to fit labels in).

[edit] Licensing

Public domain I, the copyright holder of this work, hereby release it into the public domain. This applies worldwide.

In case this is not legally possible:
I grant anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law.


Afrikaans | Alemannisch | Aragonés | العربية | Asturianu | Български | Català | Česky | Cymraeg | Dansk | Deutsch | Eʋegbe | Ελληνικά | English | Español | Esperanto | Euskara | Estremeñu | فارسی | Français | Galego | 한국어 | हिन्दी | Hrvatski | Ido | Bahasa Indonesia | Íslenska | Italiano | עברית | Kurdî / كوردی | Latina | Lietuvių | Latviešu | Magyar | Македонски | Bahasa Melayu | Nederlands | ‪Norsk (bokmål)‬ | ‪Norsk (nynorsk)‬ | 日本語 | Polski | Português | Ripoarisch | Română | Русский | Shqip | Slovenčina | Slovenščina | Српски / Srpski | Svenska | ไทย | Tagalog | Türkçe | Українська | Tiếng Việt | Walon | ‪中文(简体)‬ | ‪中文(繁體)‬ | zh-yue-hant | +/-

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeDimensionsUserComment
current23:55, 31 December 2005300×242 (15 KB)Dcoetzee (SVG version of Image:Minimum spanning tree.png based on same original source. Original description follows. Diagram of a minimum spanning tree. Each edge is weighted with a number roughly equal to its length. Dark, thick edges are in the minimum spa)
The following pages on the English Wikipedia link to this file (pages on other projects are not listed):