MINIMUM SPANNING TREE
+========+
Time: 1 hour - 2 hours
Difficulty: Hard
Languages: Any
+========+
Given a graph represented by an adjacency matrix, implement a function that finds the minimum spanning tree of the graph using Prim's algorithm.
+========+
Please answer to this message with your solution 🙂
>>Click here to continue<<