Jump to content

Prim's algorithm

From Wiktionary, the free dictionary

English

[edit]
English Wikipedia has an article on:
Wikipedia

Etymology

[edit]

Named after computer scientist Robert C. Prim, who rediscovered and published it in 1957.

Proper noun

[edit]

Prim's algorithm

  1. (computing theory) A greedy algorithm that finds a minimum spanning tree for a weighted undirected graph.
    Synonyms: DJP algorithm, Jarník's algorithm, Prim-Dijkstra algorithm, Prim-Jarník algorithm