# Pastebin Pz6u06MJ
given a DAG:

    a     e
  /   \  /
 b     d
 |
 c

- a has no parent and two children
- b has one child
- c and d have no children
- d has two parents
- e has no parent

problem: given a node, return all paths that are below that node in a format that is non-overlapping

examples:
given a: returns [abc] and [d]
given b: returns [bc]
given d: returns [d]
given e: returns [e]