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

Description Usage Arguments Value Note See Also Examples

View source: R/dDAGtip.r

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

1

Arguments

g

an object of class "igraph" or "graphNEL"

Value

Note

none

See Also

dDAGtip

Examples

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
## Not run: 
# 1) load HPPA as igraph object
ig.HPPA <-dRDataLoader(RData='ig.HPPA')
g <- ig.HPPA

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

## End(Not run)

dnet documentation built on July 10, 2017, 1:03 a.m.

Related to dDAGtip in dnet...