Prim's algorithm
Description: Prim's algorithm is a greedy graph algorithm that constructs a minimum spanning tree of a connected weighted undirected graph.
Primary topic: Complexity and Algorithms in Graphs (35%)
Related topic: Complexity and Algorithms in Graphs (35%)
Wikidata ID: wiki/Q470813
OpenAlex ID: keywords/prim-s-algorithm
