ancestors: Build ancestors
In gecko515/HEMDAG: Hierarchical Ensemble Methods for Directed Acyclic Graphs

Description Usage Arguments Value See Also Examples

Compute the ancestors for each node of a graph.

build.ancestors(g)

build.ancestors.per.level(g, levels)

build.ancestors.bottom.up(g, levels)

`g`	a graph of class `graphNEL`. It represents the hierarchy of the classes.
`levels`	a list of character vectors. Each component represents a graph level and the elements of any component correspond to nodes. The level 0 coincides with the root node.

build.ancestos returns a named list of vectors. Each component corresponds to a node x of the graph and its vector is the set of its ancestors including also x.

build.ancestors.per.level returns a named list of vectors. Each component corresponds to a node x of the graph and its vector is the set of its ancestors including also x. The nodes are ordered from root (included) to leaves.

build.ancestors.bottom.up a named list of vectors. Each component corresponds to a node x of the graph and its vector is the set of its ancestors including also x. The nodes are ordered from leaves to root (included).

graph.levels

data(graph);
root <- root.node(g);
anc <- build.ancestors(g);
lev <- graph.levels(g, root=root);
anc.tod <-build.ancestors.per.level(g,lev);
anc.bup <- build.ancestors.bottom.up(g,lev);