|Subject:||has_edge() arg order for undirected graph|
|Date:||Wed, 27 May 2015 08:48:57 +1000|
|To:||bug-Graph-Easy [...] rt.cpan.org|
|From:||Kevin Ryde <user42_kevin [...] yahoo.com.au>|
The docs of has_edge() say it is for compatibility with Graph.pm. On an undirected graph, Graph.pm has_edge() is true of vertex names either way around. But Graph::Easy has_edge() is only true of vertex names their original way around. foo.pl below prints Graph 0.96 undirected=yes yes yes Graph::Easy 0.75 undirected=yes yes no Is this meant to be? If so the Graph::Easy docs could note an undirected graph has_edge() answers to the vertex order an edge was added (or whatever the rule).
Message body is not shown because sender requested not to inline it.