+ 2

# Prim's minimum spanning tree

I have a graph of 11x8 vertices, all of them connected with random weighted edges. But this is where iam stuck, can someone please explain me the algorithm for prim's minimum spanning tree so I could understand what to do next?

3 Answers

+ 6

https://www.geeksforgeeks.org/prims-minimum-spanning-tree-mst-greedy-algo-5/
or, if you're still confused, watch a video
https://youtu.be/cplfcGZmX7I

+ 3

There's plenty of free resources with explanation and code.
https://www.codespeedy.com/demonstrate-prims-minimum-spanning-tree-algorithm-in-python/
https://www.hackerearth.com/practice/algorithms/graphs/minimum-spanning-tree/tutorial/

+ 1

XXX [user id="12144289"]Benjamin Jürgens[/user] thank you

Hot today

What is the best coding language

1 Votes

Need solution

-1 Votes

Need solution

0 Votes