Borůvka's algorithm
id:
bor-vka-s-algorithm-313-10004296
title:
Borůvka's algorithm
text:
Borůvka's algorithm is a greedy algorithm for finding a minimum spanning tree in a graph,
or a minimum spanning forest in the case of a graph that is not connected. It was first published in 1926 by Otakar Borůvka as a method of constructing an efficient electricity network for Moravia.
The algorithm was rediscovered by Choquet in 1938; again by Florek, Łukasiewicz, Perkal, Steinhaus, and Zubrzycki in 1951; and again by Georges Sollin in 1965. This algorithm is frequently called Sollin's algorit
brand slug:
wiki
category slug:
encyclopedia
description:
Method for finding minimum spanning trees
original url:
https://en.wikipedia.org/wiki/Bor%C5%AFvka%27s_algorithm
date created:
date modified:
2024-03-11T17:55:30Z
main entity:
{"identifier":"Q1468211","url":"https://www.wikidata.org/entity/Q1468211"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/2/2e/Boruvka%27s_algorithm_%28Sollin%27s_algorithm%29_Anim.gif","width":1198,"height":673}
fields total:
13
integrity:
15