Determines the levels of a Directed Acyclic Graph (DAG) {topGO} | R Documentation |
TODO: This function take the a directed graph and constructs a named vector which contain the level on which a node is. The root has level 1.
TODO: Find the root(roots) of the DAG
buildLevels(dag, root = NULL, leafs2root = TRUE) getNoOfLevels(graphLevels) getGraphRoot(dag, leafs2root = TRUE)
dag |
~~Describe dag here~~ |
root |
~~Describe root here~~ |
leafs2root |
The leafs2root parameter tell if the graph has edges directed from the leaves to the root, or vice-versa |
graphLevels |
~~Describe graphLevels here~~ |
.....
it returns a list containing:
level2nodes |
Environment where the key is the level number with the value being the nodes on that level. |
nodes2level |
Environment where the key is the node label (the GO ID) and the value is the level on which that node lies. |
noOfLevels |
The number of levels |
noOfNodes |
The number of nodes |
Adrian Alexa
topGOdata-class
,
reverseArch
,
inducedGraph
##---- Should be DIRECTLY executable !! ---- ##-- ==> Define data, use random, ##-- or do help(data=index) for the standard data sets.