Test for the efficiency of a minimum spanning tree algorithm experimentally?

Question

I\'m doing a test to compare the efficiency of Prim\'s and Kruskal\'s algorithm in terms of time complexity. If i use java, how can i test for the runtime (experimentally) w