
Generating Graph
Graph Generated having 100 vertices , 461 edges.

Running Prim's Algorithm using Binary Heap
Total time taken : 0 milliseconds
t/(n.n.log(n)) : 0.0

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 0 milliseconds
t/(n.n) : 0.0
t/(n.log(n)) : 0.0

Generating Graph
Graph Generated having 200 vertices , 1060 edges.

Running Prim's Algorithm using Binary Heap
Total time taken : 60 milliseconds
t/(n.n.log(n)) : 2.831087487266323E-4

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 0 milliseconds
t/(n.n) : 0.0
t/(n.log(n)) : 0.0

Generating Graph
Graph Generated having 300 vertices , 1712 edges.

Running Prim's Algorithm using Binary Heap
Total time taken : 60 milliseconds
t/(n.n.log(n)) : 1.168815026920974E-4

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 0 milliseconds
t/(n.n) : 0.0
t/(n.log(n)) : 0.0

Generating Graph
Graph Generated having 400 vertices , 2396 edges.

Running Prim's Algorithm using Binary Heap
Total time taken : 60 milliseconds
t/(n.n.log(n)) : 6.258903763037513E-5

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 0 milliseconds
t/(n.n) : 0.0
t/(n.log(n)) : 0.0

Generating Graph
Graph Generated having 500 vertices , 3107 edges.

Running Prim's Algorithm using Binary Heap
Total time taken : 0 milliseconds
t/(n.n.log(n)) : 0.0

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 60 milliseconds
t/(n.n) : 2.4E-4
t/(n.log(n)) : 0.0193093430992803

Generating Graph
Graph Generated having 500 vertices , 120000 edges.

Running Prim's Algorithm using Binary Heap
Total time taken : 160 milliseconds
t/(n.n.log(n)) : 1.029831631961616E-4

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 220 milliseconds
t/(n.n) : 8.8E-4
t/(n.log(n)) : 0.07080092469736109

Generating Graph
Graph Generated having 700 vertices , 4585 edges.

Running Prim's Algorithm using Binary Heap
Total time taken : 0 milliseconds
t/(n.n.log(n)) : 0.0

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 0 milliseconds
t/(n.n) : 0.0
t/(n.log(n)) : 0.0

Generating Graph
Graph Generated having 800 vertices , 5347 edges.

Running Prim's Algorithm using Binary Heap
Total time taken : 0 milliseconds
t/(n.n.log(n)) : 0.0

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 50 milliseconds
t/(n.n) : 7.8125E-5
t/(n.log(n)) : 0.00934983250280783

Generating Graph
Graph Generated having 900 vertices , 6122 edges.

Running Prim's Algorithm using Binary Heap
Total time taken : 50 milliseconds
t/(n.n.log(n)) : 9.074509376395249E-6

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 0 milliseconds
t/(n.n) : 0.0
t/(n.log(n)) : 0.0

Generating Graph
Graph Generated having 1000 vertices , 6907 edges.

Running Prim's Algorithm using Binary Heap
Total time taken : 50 milliseconds
t/(n.n.log(n)) : 7.238241365054198E-6

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 60 milliseconds
t/(n.n) : 6.0E-5
t/(n.log(n)) : 0.008685889638065037

Generating Graph
Graph Generated having 1200 vertices , 8508 edges.

Running Prim's Algorithm using Binary Heap
Total time taken : 60 milliseconds
t/(n.n.log(n)) : 5.876758127136116E-6

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 50 milliseconds
t/(n.n) : 3.472222222222222E-5
t/(n.log(n)) : 0.005876758127136117

Generating Graph
Graph Generated having 1400 vertices , 10141 edges.

Running Prim's Algorithm using Binary Heap
Total time taken : 50 milliseconds
t/(n.n.log(n)) : 3.5214526361418376E-6

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 60 milliseconds
t/(n.n) : 3.061224489795918E-5
t/(n.log(n)) : 0.005916040428718288

Generating Graph
Graph Generated having 1600 vertices , 11804 edges.

Running Prim's Algorithm using Binary Heap
Total time taken : 60 milliseconds
t/(n.n.log(n)) : 3.176777703302541E-6

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 50 milliseconds
t/(n.n) : 1.953125E-5
t/(n.log(n)) : 0.004235703604403387

Generating Graph
Graph Generated having 1800 vertices , 13491 edges.

Running Prim's Algorithm using Binary Heap
Total time taken : 60 milliseconds
t/(n.n.log(n)) : 2.4706043481790003E-6

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 50 milliseconds
t/(n.n) : 1.54320987654321E-5
t/(n.log(n)) : 0.0037059065222685

Generating Graph
Graph Generated having 2000 vertices , 15201 edges.

Running Prim's Algorithm using Binary Heap
Total time taken : 50 milliseconds
t/(n.n.log(n)) : 1.6445415615493985E-6

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 110 milliseconds
t/(n.n) : 2.75E-5
t/(n.log(n)) : 0.007235982870817353

Generating Graph
Graph Generated having 2200 vertices , 16931 edges.

Running Prim's Algorithm using Binary Heap
Total time taken : 160 milliseconds
t/(n.n.log(n)) : 4.295340161297418E-6

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 110 milliseconds
t/(n.n) : 2.2727272727272726E-5
t/(n.log(n)) : 0.006496701993962344

Generating Graph
Graph Generated having 2400 vertices , 18679 edges.

Running Prim's Algorithm using Binary Heap
Total time taken : 60 milliseconds
t/(n.n.log(n)) : 1.338348561573373E-6

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 160 milliseconds
t/(n.n) : 2.777777777777778E-5
t/(n.log(n)) : 0.008565430794069587

Generating Graph
Graph Generated having 2600 vertices , 20444 edges.

Running Prim's Algorithm using Binary Heap
Total time taken : 50 milliseconds
t/(n.n.log(n)) : 9.40633195305179E-7

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 110 milliseconds
t/(n.n) : 1.6272189349112425E-5
t/(n.log(n)) : 0.005380421877145623

Generating Graph
Graph Generated having 2800 vertices , 22224 edges.

Running Prim's Algorithm using Binary Heap
Total time taken : 60 milliseconds
t/(n.n.log(n)) : 9.6418041448756E-7

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 220 milliseconds
t/(n.n) : 2.8061224489795918E-5
t/(n.log(n)) : 0.009898918922072281
