Facts
Urlhttps://en.wikipedia.org/wiki/Bor%C5%AFvka%27s_algorithm
Sources
Wikipedia: Boruvka's algorithm
Lead sectionQuote, Lead section
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.
Claims Backed By This Source (11 claims)
This source backs 11 claims across the atlas. As facts: 4 well-attested. As cited relationships: 4 holds. Plus 3 entities citing it as a general reference with no single fact or relationship attached.
Disposition By Topic
- Algorithms, 9 claims: 3 well-attested, 3 holds, 3 general references.
- Pioneers, 1 claims: 1 holds.
- Sources, 1 claims: 1 well-attested.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.