Delwedd:Minimum spanning tree.svg
Neidio i'r panel llywio
Neidio i'r bar chwilio
Minimum_spanning_tree.svg (Ffeil SVG, maint mewn enw 300 × 242 picsel, maint y ffeil: 15 KB)
Crynodeb
| Disgrifiad |
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). |
| Dyddiad | 31 Rhagfyr 2005 (original upload date) |
| Ffynhonnell | No machine-readable source provided. Own work assumed (based on copyright claims). |
| Awdur | No machine-readable author provided. Dcoetzee assumed (based on copyright claims). |
| SVG genesis |  This trigonometry was created with Adobe Illustrator. |
Trwyddedu
|
Yr wyf fi, deiliad hawlfraint y gwaith hwn, yn ei ryddhau i'r parth cyhoeddus, a hynny'n fyd-eang. Hwyrach nad yw hyn yn bosib yn ôl cyfraith rhai gwledydd; os felly: Rwyn rhoi i unrhywun yr hawl i ddefnyddio'r gwaith hwn at unrhyw ddiben, heb unrhyw amodau, oddieithr unrhyw amodau gofynnol yn ôl y gyfraith. |
Hanes y ffeil
Cliciwch ar ddyddiad / amser i weld y ffeil fel ag yr oedd bryd hynny.
| Dyddiad/Amser | Bawdlun | Hyd a lled | Defnyddiwr | Sylw | |
|---|---|---|---|---|---|
| cyfredol | 01:55, 1 Ionawr 2006 | | 300 × 242 (15 KB) | wikimediacommons>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 |
Defnydd y ffeil
Mae'r 1 tudalennau a ddefnyddir isod yn cysylltu i'r ddelwedd hon:
