Boost C++ Libraries: Ticket #11406: Bug in edge connectivity - directed graphs https://svn.boost.org/trac10/ticket/11406 <p> The Boost edge connectivity algorithm gives a wrong result on a directed path with 3 vertices and 2 edges: 0 --&gt; 1 --&gt; 2. In particular, the output is 1, while it should be 0 (because the graph is not strongly connected). </p> <p> 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 --&gt; 0, obtaining: 0 &lt;-&gt; 1 --&gt; 2. </p> <p> A minimal example of this issue is attached. </p> en-us Boost C++ Libraries /htdocs/site/boost.png https://svn.boost.org/trac10/ticket/11406 Trac 1.4.3 Michele Borassi <michele.borassi@…> Thu, 18 Jun 2015 16:24:06 GMT attachment set https://svn.boost.org/trac10/ticket/11406 https://svn.boost.org/trac10/ticket/11406 <ul> <li><strong>attachment</strong> → <span class="trac-field-new">main.cpp</span> </li> </ul> Ticket Michele Borassi <michele.borassi@…> Thu, 18 Jun 2015 16:24:44 GMT attachment set https://svn.boost.org/trac10/ticket/11406 https://svn.boost.org/trac10/ticket/11406 <ul> <li><strong>attachment</strong> → <span class="trac-field-new">boost_edge_connectivity_bug.cpp</span> </li> </ul> Ticket Michele Borassi <michele.borassi@…> Tue, 23 Jun 2015 12:39:36 GMT <link>https://svn.boost.org/trac10/ticket/11406#comment:1 </link> <guid isPermaLink="false">https://svn.boost.org/trac10/ticket/11406#comment:1</guid> <description> <p> Hello, Martin just made me realize that in the code there is a comment "Create a network flow graph out of the undirected graph", and that line is the reason why the edge connectivity is not working on directed graphs. However, I think this issue should be more emphasized than a simple comment in the middle of a code, so I do not close the ticket (a user, like me, might not read the whole code before using the routine). Thank you very much! </p> </description> <category>Ticket</category> </item> </channel> </rss>