{"version":"1.0","type":"link","title":"Prim's algorithm - Newikis","description":"In computer science, Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. The algorithm…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://upload.wikimedia.org/wikipedia/commons/9/9b/PrimAlgDemo.gif","thumbnail_width":314,"thumbnail_height":323}