Gets all vertices in a graph that are half-trek reachable from a set of nodes. WARNING: Often the half-trek reachable nodes from a vertex v are defined to not include the vertex v or its siblings. We DO NOT follow this convention, the returned set will include input nodes and their siblings.

1 | ```
htr(dG, bG, nodes)
``` |

`dG` |
a directed graph representing the directed part of the mixed graph. |

`bG` |
an undirected graph representing the undirected part of the mixed graph. |

`nodes` |
the nodes in the graph of which to get the HTR nodes. |

a sorted list of all half-trek reachable nodes.

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

All documentation is copyright its authors; we didn't write any of that.