id,summary,reporter,owner,description,type,status,milestone,component,version,severity,resolution,keywords,cc
11406,Bug in edge connectivity - directed graphs,Michele Borassi <michele.borassi@…>,Jeremiah Willcock,"The Boost edge connectivity algorithm gives a wrong result on a directed path with 3 vertices and 2 edges:
0 --> 1 --> 2.
In particular, the output is 1, while it should be 0 (because the graph is not strongly connected).

This issue is not due to a different definition of directed edge connectivity, because the output becomes (correctly) 0 if I add an edge 1 --> 0, obtaining:
0 <-> 1 --> 2.

A minimal example of this issue is attached.",Bugs,new,To Be Determined,graph,Boost 1.58.0,Problem,,"edge connectivity, directed graphs",