File:Complete network.svg

La bildo estas kopiita de wikipedia:en. La originala priskribo estas:

[edit] Summary

Caption in Kruskal's algorithm: An example of a complete network. Each dot is a vertex, and can be turned into a tree on its own. Use the Kruskal's algorithm to find the shortest distance (spanning tree) connecting each point, or vertex.

Vectorized by Mysid per cleanup request.

[edit] Licensing

I, the copyright holder of this work, hereby publish it under the following license: Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled GNU Free Documentation License. www.gnu.org/copyleft/fdl.htmlGFDLGNU Free Documentation Licensetruetrue This file is licensed under the Creative Commons Attribution-Share Alike 3.0 Unported license. You are free: to share – to copy, distribute and transmit the work to remix – to adapt the work Under the following conditions: attribution – You must attribute the work in the manner specified by the author or licensor (but not in any way that suggests that they endorse you or your use of the work). share alike – If you alter, transform, or build upon this work, you may distribute the resulting work only under the same or similar license to this one. This licensing tag was added to this file as part of the GFDL licensing update.www.creativecommons.org/licenses/by-sa/3.0/CC-BY-SA-3.0Creative Commons Attribution-Share Alike 3.0 truetrue

[edit] Historio de la dosiero

Legend: (cur) = this is the current file, (del) = delete this old version, (rev) = revert to this old version.

Click on date to download the file or see the image uploaded on that date.

• (del) (cur) 13:22, 18 October 2005 . . en:User:Mysid Mysid ( en:User_talk:Mysid Talk) . . 500x352 (1806 bytes) (A cleaned-up version of :Image:Algorithm.JPG, originally by Matt Wardill ( en:User:Jax_Omen User:Jax Omen). Caption in en:Kruskal's_algorithm Kruskal's algorithm: An example of a complete network. Each dot is a vertex, and can be turned into a tree on its own. Use the Kruskal's alg)

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

	Date/Time	Thumbnail	Dimensions	User	Comment
current	15:17, 19 March 2006		500 × 352 (2 KB)	Maksim	(La bildo estas kopiita de wikipedia:en. La originala priskribo estas: == Summary == Caption in Kruskal's algorithm: ''An example of a complete network. Each dot is a vertex, and can be turned into a tree on its own. Use the Kruskal's algorithm to fin)

The following other wikis use this file:

• Usage on nl.wikipedia.org
  • Kruskals algoritme