Topic: Divide And Conquer Problem / Level: intermediate

Problem: Use divide and conquer to solve the problem of finding the minimum spanning tree in a graph.

Run the code to see the output here...