Benchmarks Breadth First Search algorithms. More...

Inheritance diagram for bridges.bfs_benchmark.BFSBenchamrk:

Public Member Functions
	__init__ (self, p)

	run (self, algo_name, bfsalgo)
	benchmark one implementation

Additional Inherited Members
Protected Member Functions inherited from bridges.graph_benchmark.GraphBenchmark
	_genertate_wiki_data_movie_actor (self, year_min, year_max, movie_graph)

	_highest_degree_vertex (self, gr)

	_count_vertices (self, gr)

	_count_edges (self, gr)

Protected Attributes inherited from bridges.graph_benchmark.GraphBenchmark
	_time_cap

Properties inherited from bridges.graph_benchmark.GraphBenchmark
	time_cap = property

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

Constructor & Destructor Documentation

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

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: