Fast Spanning Tree 

Compare timings for computing spanning trees for graphs. Experiments were performed on an Intel Core i7 2.93 GHz Windows 7 system, with a time limit of 1000 seconds.

show complete Wolfram Language inputhide input

In[1]:=

X (* Random Graphs *) SeedRandom[1] data = Table[RandomGraph[{i, 5000}], {i, 10000, 100000, 10000}]; (* timing *) timing = First[AbsoluteTiming[FindSpanningTree[#]]] & /@ data;

Out[1]=