File:Minimum spanning tree.svg
From Wikimedia Commons, the free media repository
Minimum_spanning_tree.svg (SVG file, nominally 300 × 242 pixels, file size: 15 KB)
[edit] Summary
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
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 23:55, 31 December 2005 | 300×242 (15 KB) | Dcoetzee (talk | contribs) | (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) |
- Edit this file using an external application (See the setup instructions for more information)
File links
The following 2 pages link to this file:
Global file usage
The following other wikis use this file:
- Usage of Minimum spanning tree.svg on cswiki
- Usage of Minimum spanning tree.svg on dewiki
- Usage of Minimum spanning tree.svg on enwiki
- Usage of Minimum spanning tree.svg on frwiki
- Usage of Minimum spanning tree.svg on simplewiki
- Usage of Minimum spanning tree.svg on urwiki