bridges.bfs_benchmark.BFSBenchamrk Class Reference

Benchmarks Breadth First Search algorithms. More...

Inheritance diagram for bridges.bfs_benchmark.BFSBenchamrk:

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)

Detailed Description

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

Author

Erik Saule

Date

07212019

Constructor & Destructor Documentation

__init__()

def bridges.bfs_benchmark.BFSBenchamrk.__init__	(		self,
			p
	)

Reimplemented from bridges.graph_benchmark.GraphBenchmark.

Member Function Documentation

run()

def bridges.bfs_benchmark.BFSBenchamrk.run	(		self,
			algo_name,
			bfsalgo
	)

benchmark one implementation

Parameters

algo_name	screen name of the algorithm to be used in the visualization
bfsalgo	pointer to the sorting function to benchmark

---

The documentation for this class was generated from the following file:

• bridges-python/bridges/bfs_benchmark.py