Prim's algorithm

Show Summary Details

Quick Reference

A method of finding the minimum-cost spanning tree of a weighted undirected graph, developed by R. C. Prim (1957).

Subjects: Mathematics.

Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.