Prim's algorithm
Prim's algorithm proper noun: a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph.
Proper noun
Prim's algorithm
- A greedy algorithm that finds a minimum spanning tree for a weighted undirected graph.
Synonyms of Prim's algorithm
Origin of Prim's algorithm
Named after computer scientist Robert C. Prim, who rediscovered and published it in 1957.
Questions about Prim's algorithm
- What does Prim's algorithm mean?
- Prim's algorithm means a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph.
- What part of speech is Prim's algorithm?
- Prim's algorithm is a proper noun.
Words near Prim's algorithm in the dictionary
Source and license
Adapted from Wiktionary: Prim's algorithm (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “Prim's algorithm.” Word.ws, https://word.ws/prim%27s_algorithm. Based on Wiktionary, CC BY-SA 4.0.
