Generating Graph
Graph Generated having 100 vertices , 2500 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) : 0.0050
t/(n.log(n)) : 0.10857362047581295
Generating Graph
Graph Generated having 200 vertices , 10000 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) : 0.0015
t/(n.log(n)) : 0.05662174974532645
Generating Graph
Graph Generated having 300 vertices , 22500 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) : 5.555555555555556E-4
t/(n.log(n)) : 0.029220375673024348
Generating Graph
Graph Generated having 400 vertices , 40000 edges.

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

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 60 milliseconds
t/(n.n) : 3.75E-4
t/(n.log(n)) : 0.025035615052150056
Generating Graph
Graph Generated having 500 vertices , 62500 edges.

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

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 110 milliseconds
t/(n.n) : 4.4E-4
t/(n.log(n)) : 0.03540046234868054
Generating Graph
Graph Generated having 600 vertices , 90000 edges.

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

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 160 milliseconds
t/(n.n) : 4.4444444444444447E-4
t/(n.log(n)) : 0.04168666548478033
Generating Graph
Graph Generated having 650 vertices , 105625 edges.

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

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 220 milliseconds
t/(n.n) : 5.207100591715976E-4
t/(n.log(n)) : 0.05225613442490201
Generating Graph
Graph Generated having 700 vertices , 122500 edges.

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

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 220 milliseconds
t/(n.n) : 4.489795918367347E-4
t/(n.log(n)) : 0.04797463902320349
Generating Graph
Graph Generated having 750 vertices , 140625 edges.

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

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 280 milliseconds
t/(n.n) : 4.977777777777778E-4
t/(n.log(n)) : 0.056394139715110626
Generating Graph
Graph Generated having 800 vertices , 160000 edges.

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

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 330 milliseconds
t/(n.n) : 5.15625E-4
t/(n.log(n)) : 0.06170889451853169
Generating Graph
Graph Generated having 850 vertices , 180625 edges.

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

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 330 milliseconds
t/(n.n) : 4.5674740484429066E-4
t/(n.log(n)) : 0.05755695931208187
Generating Graph
Graph Generated having 900 vertices , 202500 edges.

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

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 390 milliseconds
t/(n.n) : 4.814814814814815E-4
t/(n.log(n)) : 0.06370305582229464
Generating Graph
Graph Generated having 950 vertices , 225625 edges.

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

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 380 milliseconds
t/(n.n) : 4.210526315789474E-4
t/(n.log(n)) : 0.05833912605345706
Generating Graph
Graph Generated having 1000 vertices , 250000 edges.

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

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 440 milliseconds
t/(n.n) : 4.4E-4
t/(n.log(n)) : 0.06369652401247694
Generating Graph
Graph Generated having 1100 vertices , 302500 edges.

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

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 500 milliseconds
t/(n.n) : 4.1322314049586776E-4
t/(n.log(n)) : 0.06490664084471105
Generating Graph
Graph Generated having 1200 vertices , 360000 edges.

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

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 660 milliseconds
t/(n.n) : 4.583333333333333E-4
t/(n.log(n)) : 0.07757320727819673


Generating Graph
Graph Generated having 1150 vertices , 330625 edges.

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

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 550 milliseconds
t/(n.n) : 4.1587901701323253E-4
t/(n.log(n)) : 0.06786232009704946

Generating Graph
Graph Generated having 1150 vertices , 300000 edges.

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

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 490 milliseconds
t/(n.n) : 3.7051039697542535E-4
t/(n.log(n)) : 0.06045915790464406

Generating Graph
Graph Generated having 1100 vertices , 250000 edges.

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

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 500 milliseconds
t/(n.n) : 4.1322314049586776E-4
t/(n.log(n)) : 0.06490664084471105

Generating Graph
Graph Generated having 1100 vertices , 200000 edges.

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

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 380 milliseconds
t/(n.n) : 3.140495867768595E-4
t/(n.log(n)) : 0.049329047041980406

Generating Graph
Graph Generated having 1100 vertices , 330000 edges.

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

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 660 milliseconds
t/(n.n) : 5.454545454545455E-4
t/(n.log(n)) : 0.0856767659150186

Generating Graph
Graph Generated having 1100 vertices , 370000 edges.

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

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 760 milliseconds
t/(n.n) : 6.28099173553719E-4
t/(n.log(n)) : 0.09865809408396081

Generating Graph
Graph Generated having 1100 vertices , 400000 edges.

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

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

Generating Graph
Graph Generated having 950 vertices , 200000 edges.

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

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 330 milliseconds
t/(n.n) : 3.656509695290859E-4
t/(n.log(n)) : 0.050662925256949556

Generating Graph
Graph Generated having 950 vertices , 250000 edges.

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

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 430 milliseconds
t/(n.n) : 4.7645429362880884E-4
t/(n.log(n)) : 0.06601532684996457

Generating Graph
Graph Generated having 950 vertices , 300000 edges.

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

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 490 milliseconds
t/(n.n) : 5.429362880886426E-4
t/(n.log(n)) : 0.07522676780577359

Generating Graph
Graph Generated having 950 vertices , 150000 edges.

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

Running Prim's Algorithm using Fibonacci Heap
Total time taken : 270 milliseconds
t/(n.n) : 2.9916897506925206E-4
t/(n.log(n)) : 0.04145148430114055
