Prim's algorithm - Wikipedia, the free encyclopedia

In computer science, Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a connected weighted undirected graph. This means it finds a ...

en.wikipedia.org