A non redundant set of paths would be better as output if someone can do that, or, given the output as it is above, easily remove the redundant paths.
In reply to Re^5: How do I use Graph::Traversal?
by melmoth
in thread How do I use Graph::Traversal?
by thor
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |