Description Usage Arguments Value Examples
Fast greedy set cover algorithm.
1 | greedySetCover(X, data.table = TRUE)
|
X |
Two-column data.frame in long format: Column 1 identifies the sets, column 2 the elements. |
data.table |
If |
If data.table == TRUE
a data.table
, keyed by sets and elements.
Else a data.frame
, sorted by sets and elements.
Column names are derived from input.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 | # Create some data.
set.seed(333)
X <- data.table::rbindlist(
lapply(
seq_len(1e4L),
function(x) list(element=sample.int(n=1e3L,size=sample.int(50L,1L)))
),
idcol="set"
)
# Elements are integers 1,2,...,1000.
# Run set cover
res <- greedySetCover(X,FALSE)
head(res)
# Check if all elements are covered.
identical(sort(unique(res$element)),sort(unique(X$element)))
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.