Description Usage Arguments Details Value
For each identifier in ids
, ancestry_graph
creates and returns a
list
with the two following keys:
1 | ancestry_graph(chosen_ids, all_ids, store)
|
chosen_ids |
identifiers, possibly disconnected |
all_ids |
all identifiers, superset of |
store |
object store; see storage::object_store |
parents
which is read directly from store
children
which is inferred from parents
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.
A list
named according to ids
; each element is a list with
two keys: parents
and children
.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.