This is like something I've only come across as an interview question, but its a practical application on a personal project.

Given a tree:
* Every parent can have more than one child
* Every child can have more than one parent and can share parents with other siblings
* Children cannot be parents with ancestors or other siblings
* There is only one root node

Print every unique path from root to a given leaf.

#softwareengineer

attached is example diagram

@0x0caf a directed acyclic graph? Could you use the daggy crate?
@toholio Wow, there's a crate for everything I guess. Good to know, thank you! It was fun coding it myself though.