o.k that last one was a poor example as I could have computed the components first. The solution is required for other logical possibilities, such as:
v1 -> v2
v2 -> v3
v2 -> v5
v3 -> v4
The paths would then be:
v1 -> v2 ->v3 -> v4
v1 -> v2 -> v3
In reply to Re^3: How do I use Graph::Traversal?
by Anonymous Monk
in thread How do I use Graph::Traversal?
by thor
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |