Jump to content

File:Borůvka Algorithm 3.svg

Page contents not supported in other languages.
This is a file from the Wikimedia Commons
From Wikipedia, the free encyclopedia

Original file (SVG file, nominally 616 × 540 pixels, file size: 18 KB)

Summary

Description
English: Final state of Borůvka's algorithm on a sample graph. Each of the two components identifies the smallest-weight edge out of the component, which happens to be the same edge, and adds it to the tree, completing the tree.
Date
Source Own work, based on File:Prim Algorithm 0.svg
Author User:Dcoetzee, User:Maksim, User:Alexander Drichel

Licensing

w:en:Creative Commons
attribution share alike
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 give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
  • share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.

Captions

Add a one-line explanation of what this file represents

Items portrayed in this file

depicts

18 December 2012

image/svg+xml

76029a49693132b6fa2ae0c1601e40c1ca158b82

18,215 byte

540 pixel

616 pixel

File history

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

Date/TimeThumbnailDimensionsUserComment
current10:26, 18 December 2012Thumbnail for version as of 10:26, 18 December 2012616 × 540 (18 KB)DcoetzeeDistinct edge weights (required for basic algorithm)
10:04, 18 December 2012Thumbnail for version as of 10:04, 18 December 2012616 × 540 (18 KB)DcoetzeeGet component bubble inside near C
10:03, 18 December 2012Thumbnail for version as of 10:03, 18 December 2012616 × 540 (18 KB)Dcoetzee{{Information |Description ={{en|1=Final state of Borůvka's algorithm on a sample graph. Each of the two components identifies the smallest-weight edge out of the component, which happens to be the same edge, and adds it to the tree, completing the...

The following page uses this file:

Global file usage

The following other wikis use this file:

Metadata