Bridges-Java 3.5.0
Bridges(Java API)
Public Member Functions | List of all members
bridges.benchmark.BFSBenchmark Class Reference

Benchmarks Breadth First Search algorithms. More...

Inheritance diagram for bridges.benchmark.BFSBenchmark:
bridges.benchmark.GraphBenchmark bridges.benchmark.Benchmark

Public Member Functions

 BFSBenchmark (LineChart plot, long timeCap)
 
 BFSBenchmark (LineChart plot)
 
void run (String algoName, DataSource ds, Consumer< BFSParams > bfsAlgo) throws IOException
 benchmark a particular BFS algorithm that accepts a single BFSParams argument More...
 
- Public Member Functions inherited from bridges.benchmark.Benchmark
void setTimeCap (long cap_in_ms)
 sets an upper bound to the time of a run. More...
 
long getTimeCap ()
 Return time limit of a run. More...
 

Additional Inherited Members

- Package Functions inherited from bridges.benchmark.GraphBenchmark
 GraphBenchmark (LineChart plot)
 
 GraphBenchmark (LineChart plot, long timeCap)
 
void generateWikidataActorMovieData (int yearMin, int yearMax, long[] counts, GraphAdjList< String, String, String > graph, DataSource ds) throws IOException
 
String highestDegreeVertex (GraphAdjList< String, String, String > graph)
 
- Package Functions inherited from bridges.benchmark.Benchmark
 Benchmark (LineChart plot, long timeCap)
 
 Benchmark (LineChart plot)
 
- Package Attributes inherited from bridges.benchmark.Benchmark
LineChart plot
 
- Static Package Attributes inherited from bridges.benchmark.GraphBenchmark
static final int CURRENT_YEAR = 2019
 

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().

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

BFSBenchmark sb (lc) = new BFSBenchmark(lc);
sb.run("mybfsalgorithm", bfsalgo);
Enable plotting series of data or functions using a line chart.
Definition: LineChart.java:43
Benchmarks Breadth First Search algorithms.
Definition: BFSBenchmark.java:33
BFSBenchmark(LineChart plot, long timeCap)
Definition: BFSBenchmark.java:35
Author
Erik Saule
Date
07/21/2019

Constructor & Destructor Documentation

◆ BFSBenchmark() [1/2]

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

◆ BFSBenchmark() [2/2]

bridges.benchmark.BFSBenchmark.BFSBenchmark ( LineChart  plot)

Member Function Documentation

◆ run()

void bridges.benchmark.BFSBenchmark.run ( String  algoName,
DataSource  ds,
Consumer< BFSParams bfsAlgo 
) throws IOException

benchmark a particular BFS algorithm that accepts a single BFSParams argument

Parameters
algoNameScreen name of the algorithm
dsa DataSource object used to create the underlying dataset
bfsAlgothe actual algorithm

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