netrankr (version 0.2.1)

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.

Examples

# NOT RUN {
library(igraph)
g <- threshold_graph(20,0.1)
P <- neighborhood_inclusion(g)
d <- dominance_graph(P)
# }
# NOT RUN {
plot(d)
# }
# NOT RUN {
# to reduce overplotting use transitive reduction
P <- transitive_reduction(P)
d <- dominance_graph(P)
# }
# NOT RUN {
plot(d)
# }