![]() |
Bridges-Python-3.0.2
3.0.2
Bridges(PythonAPI)
|
Benchmarks Breadth First Search algorithms.
Benchmarks BFS algorithms and add time series to a LineChart.
One can also set a maximum time spent on a particular run using setTimeCap().
The BFS algorithms must have for prototype:
and can be passed to the run function for being benchmarked. A typical use would look something like
code lc LineChart(); sb BFSBenchmark(lc); sb.run("mybfsalgorithm", bfsalgo); endcode
Public Member Functions | |
| def | __init__ (self, p) |
| def | run (self, algo_name, bfsalgo) |
| benchmark one implementation More... | |
Public Member Functions inherited from bridges.graph_benchmark.GraphBenchmark | |
| def | __init__ (self) |
| def | time_cap (self) |
| def | time_cap (self, cap_in_s) |
| def bridges.bfs_benchmark.BFSBenchamrk.__init__ | ( | self, | |
| p | |||
| ) |
| def bridges.bfs_benchmark.BFSBenchamrk.run | ( | self, | |
| algo_name, | |||
| bfsalgo | |||
| ) |
benchmark one implementation
| algo_name | screen name of the algorithm to be used in the visualization |
| bfsalgo | pointer to the sorting function to benchmark |
1.8.13