netrankr: dominance_graph – R documentation

Become an expert in R — Interactive courses, Cheat Sheets, certificates and more!

dominance_graph

Partial ranking as directed graph

Description

Turns a partial ranking into a directed graph. An edge (u,v) is present if P[u,v]=1, meaning that u is dominated by v.

Usage

dominance_graph(P)

Arguments

`P`	A partial ranking as matrix object calculated with neighborhood_inclusion or positional_dominance.

Value

Directed graph as an igraph object.

Author(s)

David Schoch

Examples

library(igraph)
g <- threshold_graph(20,0.1)
P <- neighborhood_inclusion(g)
d <- dominance_graph(P)
## Not run: plot(d)

# to reduce overplotting use transitive reduction
P <- transitive_reduction(P)
d <- dominance_graph(P)
## Not run: plot(d)

netrankr

Analyzing Partial Rankings in Networks

v0.3.0

MIT + file LICENSE

Authors

David Schoch [aut, cre], Julian Müller [ctb]

Initial release