bridges.benchmark.ShortestPathBenchmark Class Reference

Inherits bridges.benchmark.GraphBenchmark.

Detailed Description

Benchmarks Shortest Path algorithms.

Benchmarks Shortest Path algorithms and add time series to a LineChart.

One can also set a maximum time spent on a particular run using setTimeCap();

and can be passed to the run function for being benchmarked. A typical use would look something like

LineChart lc;
ShortestPathBenchmark sb = new ShortestPathBenchmark(lc);
sb.run("mybfsalgorithm", spalgo);

Author

Erik Saule

Date

07/21/2019

Public Member Functions
	ShortestPathBenchmark (LineChart plot, long timeCap)
	ShortestPathBenchmark (LineChart plot)
void	run (String algoName, Consumer< ShortestPathParams > spAlgo) throws IOException
	benchmark a particular Shortest Path algorithm that accepts a single ShortestPathParams argument More...

Constructor & Destructor Documentation

ShortestPathBenchmark() [1/2]

bridges.benchmark.ShortestPathBenchmark.ShortestPathBenchmark	(	LineChart	plot,
		long	timeCap
	)

ShortestPathBenchmark() [2/2]

bridges.benchmark.ShortestPathBenchmark.ShortestPathBenchmark

(

LineChart

plot

)

Member Function Documentation

run()

void bridges.benchmark.ShortestPathBenchmark.run	(	String	algoName,
		Consumer< ShortestPathParams >	spAlgo
	)		throws IOException

benchmark a particular Shortest Path algorithm that accepts a single ShortestPathParams argument

Parameters

algoName	Screen name of the algorithm
spAlgo	the actual algorithm

---

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

• /home/erik/work/bridges/bridges-java/src/main/java/bridges/benchmark/ShortestPathBenchmark.java