+ 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?

1st Feb 2021, 8:30 AM
Kirill
Kirill - avatar
3 Answers
1st Feb 2021, 9:19 AM
XXX
XXX - avatar
+ 1
XXX [user id="12144289"]Benjamin Jürgens[/user] thank you
1st Feb 2021, 9:33 AM
Kirill
Kirill - avatar