File:Minimum spanning tree.svg
Jump to navigation
Jump to search
Size of this PNG preview of this SVG file: 300 × 242 pixels.
Original file (SVG file, nominally 300 × 242 pixels, file size: 15 KB)
Summary
| Description |
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 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). |
| Date | 31 December 2005 (original upload date) |
| Source | No machine-readable source provided. Own work assumed (based on copyright claims). |
| Author | No machine-readable author provided. Dcoetzee assumed (based on copyright claims). |
| SVG development |  This trigonometry was created with Adobe Illustrator. |
Licensing
|
I, the copyright holder of this work, release this work into the public domain. This applies worldwide. In some countries this may not be legally possible; if so: I grant anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law. |
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 00:55, 1 January 2006 | No thumbnail | 300 × 242 (15 KB) | commonswiki>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 |
File usage
The following page uses this file:
