Facts
Urlhttps://en.wikipedia.org/wiki/Kruskal%27s_algorithm
Sources
Wikipedia, Kruskal's algorithm
Lead sectionQuote, Lead section
Kruskal's algorithm finds a minimum spanning forest of an undirected edge-weighted graph.
Claims Backed By This Source (9 claims)
This source backs 9 claims across the atlas. As facts: 3 well-attested. As cited relationships: 3 holds. Plus 3 entities citing it as a general reference with no single fact or relationship attached.
Disposition By Topic
- Algorithms, 8 claims: 2 well-attested, 3 holds, 3 general references.
- 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.