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?
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
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/
XXX [user id="12144289"]Benjamin Jürgens[/user] thank you
What is the best coding language
When you want to make a book in JS, then how do you put text other than the page nmr. on the page?