Pređi na sadržaj

Датотека:Minimum spanning tree.svg

Sadržaj stranice nije podržan na drugim jezicima
Ovo je datoteka sa Vikimedijine ostave
S Vikipedije, slobodne enciklopedije

Originalna datoteka(SVG datoteka, nominalno 300 × 242 piksela, veličina: 15 kB)

Opis izmene

Opis
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).
Datum 31. decembar 2005. (првобитни датум слања)
Izvor No machine-readable source provided. Own work assumed (based on copyright claims).
Autor No machine-readable author provided. Dcoetzee assumed (based on copyright claims).
SVG genesis
InfoField
 
The SVG code is valid.
 
This trigonometry was created with Adobe Illustrator.
 
This trigonometry uses translateable embedded text.

Licenciranje

Public domain Ja, tvorac ovog dela, predajem ga u javno vlasništvo. Ovo se odnosi na ceo svet.
U nekim zemljama, ovo nije zakonski moguće; u tom slučaju:
Ja, tvorac ovog dela dozvoljavam svakome da koristi ovo delo za bilo koju namenu, bez bilo kakvih uslova, osim uslova koje nameće zakon.

Natpisi

Dodajte objašnjenje u jednom redu o tome šta ova datoteka predstavlja
Diagram of a minimum spanning tree.

Stavke prikazane u ovoj datoteci

prikazuje

31. decembar 2005

Istorija datoteke

Kliknite na datum/vreme da biste videli tadašnju verziju datoteke.

Datum/vremeMinijaturaDimenzijeKorisnikKomentar
trenutna01:55, 1. januar 2006.Minijatura za verziju na dan 01:55, 1. januar 2006.300 × 242 (15 kB)DcoetzeeSVG 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

Globalna upotreba datoteke

Drugi vikiji koji koriste ovu datoteku:

Još globalnog korišćenja ove datoteke.