dnet (version 1.1.7)

dDAGtip: Function to find the tip node(s) of a direct acyclic graph (DAG)

Description

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

Usage

dDAGtip(g)

Arguments

g

an object of class "igraph" or "graphNEL"

Value

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

See Also

dDAGtip

Examples

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

# 2) find tips
tips <- dDAGtip(g)
tips
# }