Description Usage Arguments Value
Create an Empirical Cumulative Distribution Function (ECDF)
function over Expected Running Times (ERTs), i.e., a list with two membery
x
and y
that stand for the coordinates of the function. This
approach is suitable if we want to plot an ECDF over multiple distinct
problems. We can compute the expected running time of an algorithm on the
given problem to reach the goal
. Over all the ERTs of all problems,
we can then draw the ECDF.
1 2 3 4 | func.ertEcdf(x, goal = 0, goal.dim = 2L, time.dim = 1L,
comparator = `<=`, time.type = as.integer, goal.type = as.numeric,
time.min = 1L, time.max = time.type(NA_real_),
extract.run = identity, extract.runs = identity)
|
x |
the data, maybe a list of [lists of matrices or a list of
vectors/lists], where each element has at least the |
goal |
the goal value, i.e., the value which must be reached to be counted as success |
goal.dim |
the dimension where where the goal values can be found |
time.dim |
the dimension where the time values can be found |
comparator |
the comparator, usually |
time.type |
the type function the time dimension, should be
|
goal.type |
the type function the goal dimension, should be
|
time.min |
the minimum time value to be used for the diagram, or
|
time.max |
the maximum time value to be used, or |
extract.run |
a function which can be used to extract the single runs
from the extracted run sets, e.g., |
extract.runs |
a function which can be used to extract the run sets from
|
a list(x=c(...), y=c(...))
where the two members x
and
y
will be vectors of corresponding coordinates
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.