Learn R Programming

dnet (version 1.1.7)

dDAGroot: Function to find the root node of a direct acyclic graph (DAG)

Description

dDAGroot is supposed to find the root node of a direct acyclic graph (DAG; an ontology). It return the name (i.e Term ID) of the root node.

Usage

dDAGroot(g)

Arguments

g

an object of class "igraph" or "graphNEL"

Value

  • root: the root name (i.e. Term ID)

See Also

dDAGroot

Examples

Run this code
# NOT RUN {
# 1) load HPPA as igraph object
ig.HPPA <-dRDataLoader(RData='ig.HPPA')
g <- ig.HPPA

# 2) find the root
root <- dDAGroot(g)
root
# }

Run the code above in your browser using DataLab