Given a Directed Acyclic Graph (DAG) represented as a
instance, return a character vector consisting of the specified
term and all of its descendants. That is, give the list of
terms for which a path exists starting at
A string giving a term in the vocabulary (a node in
A character vector of term names.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.