ancestry_graph: Build a connected ancestry graph.

Description Usage Arguments Details Value

Description

For each identifier in ids, ancestry_graph creates and returns a list with the two following keys:

Usage

1
ancestry_graph(chosen_ids, all_ids, store)

Arguments

chosen_ids

identifiers, possibly disconnected

all_ids

all identifiers, superset of chosen_ids

store

object store; see storage::object_store

Details

Those lists are wrapped in a single list and named with values from ids. Furthermore, ancestry_graph verifies that all values present in parents and children are also present in ids and that the resulting graph is connected, that is, whether there is a path between any pair of nodes.

Value

A list named according to ids; each element is a list with two keys: parents and children.


lbartnik/repository documentation built on May 28, 2019, 9:50 a.m.