Brute_force_Simulation.cpp contains O(n^2) algorithm to compute expected weight of Minimum Spanning tree of a complete graph with weights w~U[0,1].

Efficient_simuation.cpp contains O(n*log(n)) algorithm to compute expected weight of Minimum Spanning tree of a complete graph with weights w~U[0,1].

CS648_project (1).pdf contains the project report highlighting 3 approaches to solve the problem statement.

CS648 Final proof (1).pdf contains additional proofs for using Prim's approach to obtain a constant upper bound on the expected weight of Minimum Spanning tree of a complete graph with weights w~U[0,1]