This gets a DAG which reflects paths visible from a given set of nodes out to a given distance, and doesn't contain extraneous tips not reachable along those paths.
Right now the implementation just computes the whole DAG and then filters down the result, but a more efficient implementation should be possible.
This gets a DAG which reflects paths visible from a given set of nodes out to a given distance, and doesn't contain extraneous tips not reachable along those paths.
Right now the implementation just computes the whole DAG and then filters down the result, but a more efficient implementation should be possible.