Description Usage Arguments Value Examples
View source: R/graph.utility.R
Build parents for each node of a graph.
1 2 3 4 5 6 7 | build.parents(g, root = "00")
build.parents.top.down(g, levels, root = "00")
build.parents.bottom.up(g, levels, root = "00")
build.parents.topological.sorting(g, root = "00")
|
g |
a graph of class |
root |
name of the class that it is on the top-level of the hierarchy ( |
levels |
a list of character vectors. Each component represents a graph level and the elements of any component correspond to nodes. The level 0 represents the root node. |
build.parents
returns a named list of character vectors. Each component corresponds to a node x of the graph (i.e. child node)
and its vector is the set of its parents (the root node is not included).
build.parents.top.down
returns a named list of character vectors. Each component corresponds to a node x of the graph (i.e. child node)
and its vector is the set of its parents. The order of nodes follows the levels of the graph from root (excluded) to leaves.
build.parents.bottom.up
returns a named list of character vectors. Each component corresponds to a node x of the
graph (i.e. child node) and its vector is the set of its parents. The nodes are ordered from leaves to root (excluded).
build.parents.topological.sorting
a named list of character vectors. Each component corresponds to a node x of the graph (i.e. child node)
and its vector is the set of its parents. The nodes are ordered according to a topological sorting, i.e. parents node come before children node.
1 2 3 4 5 6 7 | data(graph);
root <- root.node(g)
parents <- build.parents(g, root=root);
lev <- graph.levels(g, root=root);
parents.tod <- build.parents.top.down(g, lev, root=root);
parents.bup <- build.parents.bottom.up(g, lev, root=root);
parents.tsort <- build.parents.topological.sorting(g, root=root);
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.