Prim's algorithm
English
editEtymology
editNamed after computer scientist Robert C. Prim, who rediscovered and published it in 1957.
Proper noun
edit- (computing theory) A greedy algorithm that finds a minimum spanning tree for a weighted undirected graph.