Wikipedia does not yet have an article with this exact name.
Start the Robert Prim article (http://en.wikipedia.org/w/index.php?title=Robert_Prim&action=edit)
If you have created this page in the past few minutes and it has not yet appeared, it may not be visible due to a delay in updating the database. Please wait and check again later before attempting to recreate the page.
Search for Robert Prim in other articles
If you created an article under this title previously, it may have been deleted. See candidates for speedy deletion for possible reasons.
Look for Robert Prim in Wiktionary, our sister dictionary project.
Prim's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph.
The algorithm was discovered in 1930 by mathematician Vojtech Jarnik and later independently by computer scientist Robert C. Prim in 1957 and rediscovered by Dijkstra in 1959.
Using a simple binary heap data structure, Prim's algorithm can be shown to run in time which is O(mlog n) where m is the number of edges and n is the number of vertices.
Prim, married to a Presbyterian minister, the Rev. RobertPrim, and mother of a 4-year-old daughter and 2-year-old son, said when she was asked to deliver this year's lecture, she looked at accounts of previous Cardwell Lectures.
Prim expressed gratitude for the relationships that influenced her at Erskine.
As an Erskine student, Prim was listed in Who's Who Among Students in American Universities and Colleges; was president of the leadership honor society Omicron Delta Kappa; served as a Student Life Assistant; played on the women's soccer and tennis teams; and was elected vice president of her senior class.
Feeds |
Contact