| Subject: | all_reachable on directed $g->add_edges(['a','b'],['b','a']) |
Hello and thank you for Graph,
I've read the doc and looked at the source for the method all_reachable.
Here is the code I'm wondering about:
use Graph::Directed;
my $g=Graph::Directed->new;
$g->add_edges(['a','b'],['b','a']);
print "all_reachable=",$g->all_reachable('a'),"\n";
all_reachable=b
I was wondering if I was unreasonable in expecting this to return
both 'b' and 'a'. The docs are clear that for directed graphs it's
equivalent to all_successors, and the docs for all_successors and
successors are also clear.
I'm still left wondering if for directed graphs all_reachable should
be equivalent to some method such as:
all_successors_and_possibly_itself($v)
I did notice the tests in 84_all_cessors.t for all_successors, but I
didn't see any tests for all_reachable, so I wasn't sure if this
behaviour was ever anticipated.
Thanks for your thoughts on this,
Peter (Stig) Edwards