Borůvka’s algorithm

E2172196 UNEXPLORED

Borůvka’s algorithm is a greedy graph algorithm that constructs a minimum spanning tree by repeatedly adding the cheapest edge incident to each component in parallel.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (2)

Label	Occurrences
Borůvka's algorithm	1
Borůvka’s algorithm canonical	1

Referenced by (2)

Full triples — surface form annotated when it differs from this entity's canonical label.

Kruskal’s minimum spanning tree algorithm → relatedTo → Borůvka’s algorithm ⓘ

Prim's minimum spanning tree algorithm → relatedTo → Borůvka's algorithm ⓘ

linked to: Borůvka’s algorithm