coverGraph: Compute the cover graph of order generated by intervals
In rankUncertainty: Methods for Working with Uncertainty in Rankings

The cover graph of the order generated by a set of intervals is the minimal graph whose reachability relation is that order.

1	coverGraph(intervals, names = NULL)

`intervals`	data frame (see generateIntervals for the required format)
`names`	names of intervals (`1:nrow(intervals)` by default)

See section 6 of Rising (2021).

A list of edges of the cover graph.

Rising, Justin (2021). Uncertainty in Ranking. arXiv:2107.03459.

left <- sort(c(1:3, 1:3 + 0.1))
right <- left + 0.7
intervals <- data.frame(left = left, right = right)
coverGraph(intervals)

rankUncertainty documentation built on Nov. 16, 2021, 1:07 a.m.

rankUncertainty index

rdrr.io home R language documentation Run R code online

Note that we can't provide technical support on individual packages. You should contact the package authors for that.

Description