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

Share:

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

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

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)

Want to suggest features or report bugs for rdrr.io? Use the GitHub issue tracker.