Scribd
Upload
217 views

ICS 33 Quiz 8 - Sample Output

The document reports on the results of running spanning tree algorithms on graphs of increasing sizes, from 1,000 to 128,000 nodes. It provides the average, minimum, and maximum timing results for each graph size tested over 5 runs. It also shows a breakdown of the timing results into ranges to indicate the distribution of times.

Uploaded by

Andrew Bimbus
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
217 views

ICS 33 Quiz 8 - Sample Output

The document reports on the results of running spanning tree algorithms on graphs of increasing sizes, from 1,000 to 128,000 nodes. It provides the average, minimum, and maximum timing results for each graph size tested over 5 runs. It also shows a breakdown of the timing results into ranges to indicate the distribution of times.

Uploaded by

Andrew Bimbus
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Page 1

Sample output from my solution to Problem #1:


(yours should match the format: the times depend on your machines speed).
Spanning Tree of size 1000
Analysis of 5 timings
avg = 0.079
min = 0.076 max = 0.084
Time Ranges
7.59e-02<>7.66e-02[
7.66e-02<>7.74e-02[
7.74e-02<>7.82e-02[
7.82e-02<>7.89e-02[
7.89e-02<>7.97e-02[
7.97e-02<>8.05e-02[
8.05e-02<>8.12e-02[
8.12e-02<>8.20e-02[
8.20e-02<>8.28e-02[
8.28e-02<>8.35e-02[
8.35e-02<>8.43e-02[

40.0%]|**************************************************
0.0%]|
0.0%]|
0.0%]|
20.0%]|*************************A
0.0%]|
20.0%]|*************************
0.0%]|
0.0%]|
0.0%]|
20.0%]|*************************

Spanning Tree of size 2000


Analysis of 5 timings
avg = 0.166
min = 0.161 max = 0.172
Time Ranges
1.61e-01<>1.62e-01[
1.62e-01<>1.63e-01[
1.63e-01<>1.64e-01[
1.64e-01<>1.65e-01[
1.65e-01<>1.66e-01[
1.66e-01<>1.68e-01[
1.68e-01<>1.69e-01[
1.69e-01<>1.70e-01[
1.70e-01<>1.71e-01[
1.71e-01<>1.72e-01[
1.72e-01<>1.73e-01[

span = 6.1%

20.0%]|*************************
0.0%]|
0.0%]|
40.0%]|**************************************************
0.0%]|A
0.0%]|
20.0%]|*************************
0.0%]|
0.0%]|
0.0%]|
20.0%]|*************************

Spanning Tree of size 4000


Analysis of 5 timings
avg = 0.351
min = 0.342 max = 0.359
Time Ranges
3.42e-01<>3.44e-01[
3.44e-01<>3.45e-01[
3.45e-01<>3.47e-01[
3.47e-01<>3.49e-01[
3.49e-01<>3.50e-01[
3.50e-01<>3.52e-01[
3.52e-01<>3.54e-01[
3.54e-01<>3.55e-01[
3.55e-01<>3.57e-01[
3.57e-01<>3.59e-01[
3.59e-01<>3.61e-01[

span = 9.7%

span = 4.9%

20.0%]|**************************************************
0.0%]|
0.0%]|
20.0%]|**************************************************
20.0%]|**************************************************
0.0%]|A
0.0%]|
20.0%]|**************************************************
0.0%]|
0.0%]|
20.0%]|**************************************************

Spanning Tree of size 8000


Analysis of 5 timings
avg = 0.733
min = 0.723 max = 0.749

span = 3.5%

Time Ranges
7.23e-01<>7.26e-01[ 40.0%]|**************************************************

Page 2
7.26e-01<>7.28e-01[ 0.0%]|
7.28e-01<>7.31e-01[ 20.0%]|*************************
7.31e-01<>7.34e-01[ 0.0%]|A
7.34e-01<>7.36e-01[ 0.0%]|
7.36e-01<>7.39e-01[ 0.0%]|
7.39e-01<>7.41e-01[ 20.0%]|*************************
7.41e-01<>7.44e-01[ 0.0%]|
7.44e-01<>7.46e-01[ 0.0%]|
7.46e-01<>7.49e-01[ 0.0%]|
7.49e-01<>7.51e-01[ 20.0%]|*************************
Spanning Tree of size 16000
Analysis of 5 timings
avg = 1.582
min = 1.544 max = 1.642
Time Ranges
1.54e+00<>1.55e+00[
1.55e+00<>1.56e+00[
1.56e+00<>1.57e+00[
1.57e+00<>1.58e+00[
1.58e+00<>1.59e+00[
1.59e+00<>1.60e+00[
1.60e+00<>1.61e+00[
1.61e+00<>1.62e+00[
1.62e+00<>1.63e+00[
1.63e+00<>1.64e+00[
1.64e+00<>1.65e+00[

20.0%]|*************************
0.0%]|
40.0%]|**************************************************
0.0%]|A
20.0%]|*************************
0.0%]|
0.0%]|
0.0%]|
0.0%]|
0.0%]|
20.0%]|*************************

Spanning Tree of size 32000


Analysis of 5 timings
avg = 3.432
min = 3.377 max = 3.514
Time Ranges
3.38e+00<>3.39e+00[
3.39e+00<>3.40e+00[
3.40e+00<>3.42e+00[
3.42e+00<>3.43e+00[
3.43e+00<>3.45e+00[
3.45e+00<>3.46e+00[
3.46e+00<>3.47e+00[
3.47e+00<>3.49e+00[
3.49e+00<>3.50e+00[
3.50e+00<>3.51e+00[
3.51e+00<>3.53e+00[

span = 6.2%

span = 4.0%

20.0%]|**************************************************
20.0%]|**************************************************
20.0%]|**************************************************
0.0%]|A
0.0%]|
0.0%]|
20.0%]|**************************************************
0.0%]|
0.0%]|
0.0%]|
20.0%]|**************************************************

Spanning Tree of size 64000


Analysis of 5 timings
avg = 7.470
min = 7.358 max = 7.680

span = 4.3%

Time Ranges
7.36e+00<>7.39e+00[ 40.0%]|**************************************************
7.39e+00<>7.42e+00[ 0.0%]|
7.42e+00<>7.45e+00[ 0.0%]|
7.45e+00<>7.49e+00[ 40.0%]|**************************************************A
7.49e+00<>7.52e+00[ 0.0%]|
7.52e+00<>7.55e+00[ 0.0%]|
7.55e+00<>7.58e+00[ 0.0%]|
7.58e+00<>7.62e+00[ 0.0%]|
7.62e+00<>7.65e+00[ 0.0%]|
7.65e+00<>7.68e+00[ 0.0%]|
7.68e+00<>7.71e+00[ 20.0%]|*************************

Page 3
Spanning Tree of size 128000
Analysis of 5 timings
avg = 16.294
min = 16.071 max = 16.665
Time Ranges
1.61e+01<>1.61e+01[
1.61e+01<>1.62e+01[
1.62e+01<>1.62e+01[
1.62e+01<>1.63e+01[
1.63e+01<>1.64e+01[
1.64e+01<>1.64e+01[
1.64e+01<>1.65e+01[
1.65e+01<>1.65e+01[
1.65e+01<>1.66e+01[
1.66e+01<>1.67e+01[
1.67e+01<>1.67e+01[

span = 3.6%

20.0%]|**************************************************
20.0%]|**************************************************
20.0%]|**************************************************
0.0%]|A
0.0%]|
20.0%]|**************************************************
0.0%]|
0.0%]|
0.0%]|
0.0%]|
20.0%]|**************************************************

Page 4

Sample output from my solution to Problem #2:


(yours should match the format: the times/counts depend on your machines speed and the
random graph created).
Fri May 29 20:16:10 2015

profile50K

8007108 function calls (7957107 primitive calls) in 6.638 seconds


Ordered by: call count
ncalls
1999509
1205714
1049754
999755
999755
999754
552858
50002/1
50000
49999
49999
2
2
1
1
1
1
1

tottime
0.084
0.831
0.885
0.495
0.639
0.659
0.251
2.199
0.018
0.008
0.056
0.007
0.000
0.325
0.000
0.011
0.000
0.170

percall
0.000
0.000
0.000
0.000
0.000
0.000
0.000
0.000
0.000
0.000
0.000
0.003
0.000
0.325
0.000
0.011
0.000
0.170

Fri May 29 20:16:34 2015

cumtime
0.084
0.831
1.586
2.969
2.432
0.701
1.024
4.962
0.018
0.008
0.114
0.007
0.000
6.468
6.638
0.029
0.000
6.638

percall
0.000
0.000
0.000
0.000
0.000
0.000
0.000
4.962
0.000
0.000
0.000
0.003
0.000
6.468
6.638
0.029
0.000
6.638

filename:lineno(function)
{built-in method len}
equivalence.py:28(_compress_to_root)
graph.py:23(__getitem__)
graph_goody.py:27(<genexpr>)
graph.py:125(__iter__)
graph.py:12(legal_tuple)
equivalence.py:60(in_same_class)
{built-in method sorted}
equivalence.py:19(add_singleton)
{method 'add' of 'set' objects}
equivalence.py:68(merge_classes_containing)
graph.py:73(all_nodes)
{method 'keys' of 'dict' objects}
graph_goody.py:25(spanning_tree)
{built-in method exec}
equivalence.py:8(__init__)
{method 'disable' of '_lsprof.Profiler' objects}
<string>:1(<module>)

profile100K

16718291 function calls (16618290 primitive calls) in 14.579 seconds


Ordered by: internal time
ncalls
100002/1
2879692
2099790
1999790
1999791
1999791
1
1339847
1
3999581
99999
100000
1
2
99999
1
2
1

tottime
5.196
1.975
1.787
1.321
1.278
0.996
0.758
0.598
0.279
0.172
0.116
0.039
0.026
0.021
0.018
0.000
0.000
0.000

percall
0.000
0.000
0.000
0.000
0.000
0.000
0.758
0.000
0.279
0.000
0.000
0.000
0.026
0.011
0.000
0.000
0.000
0.000

cumtime
10.749
1.975
3.195
1.408
4.894
5.975
14.300
2.457
14.579
0.172
0.232
0.039
0.065
0.021
0.018
14.579
0.000
0.000

percall
10.749
0.000
0.000
0.000
0.000
0.000
14.300
0.000
14.579
0.000
0.000
0.000
0.065
0.011
0.000
14.579
0.000
0.000

filename:lineno(function)
{built-in method sorted}
equivalence.py:28(_compress_to_root)
graph.py:23(__getitem__)
graph.py:12(legal_tuple)
graph.py:125(__iter__)
graph_goody.py:27(<genexpr>)
graph_goody.py:25(spanning_tree)
equivalence.py:60(in_same_class)
<string>:1(<module>)
{built-in method len}
equivalence.py:68(merge_classes_containing)
equivalence.py:19(add_singleton)
equivalence.py:8(__init__)
graph.py:73(all_nodes)
{method 'add' of 'set' objects}
{built-in method exec}
{method 'keys' of 'dict' objects}
{method 'disable' of '_lsprof.Profiler' objects}

You might also like