Re^5: How do I use Graph::Traversal?

Replies are listed 'Best First'.
Re^6: How do I use Graph::Traversal? by Anonymous Monk on Aug 09, 2016 at 04:39 UTC
Paths to what?	[reply]
Re^7: How do I use Graph::Traversal? by Anonymous Monk on Aug 09, 2016 at 19:59 UTC
Paths to what? From each source vertex return all paths to each reachable sink vertices.	[reply]
Re^8: How do I use Graph::Traversal? by Anonymous Monk on Aug 10, 2016 at 06:59 UTC
What is that, a sink vertices? Earlier node said non redundant set of paths ... remove the redundant paths but what paths are those? I don't understand which of the paths listed in Re^4: How do I use Graph::Traversal? are redundant, unless they're all redundant The "opera_" example requirs too much brain power to decipher what is wanted, The v1 example and Re^5: How do I use Graph::Traversal? hints maybe you're only looking for paths to terminal nodes As in paths with zero "out_degree" , so why not use https://metacpan.org/pod/Graph#out_degree to decide which path to print?	[reply]


Your skill will accomplish what the force of many cannot
	PerlMonks