[Boost-bugs] [Boost C++ Libraries] #11406: Bug in edge connectivity - directed graphs

Subject: [Boost-bugs] [Boost C++ Libraries] #11406: Bug in edge connectivity - directed graphs
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2015-06-18 16:20:50

#11406: Bug in edge connectivity - directed graphs
-------------------------------------------------+----------------------
 Reporter:  Michele Borassi <michele.borassi@…>  |      Owner:  jewillco
     Type:  Bugs                                 |     Status:  new
Milestone:  To Be Determined                     |  Component:  graph
  Version:  Boost 1.58.0                         |   Severity:  Problem
 Keywords:  edge connectivity, directed graphs   |
-------------------------------------------------+----------------------
 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.

-- 
Ticket URL: <https://svn.boost.org/trac/boost/ticket/11406>
Boost C++ Libraries <http://www.boost.org/>
Boost provides free peer-reviewed portable C++ source libraries.