[Boost-bugs] [Boost C++ Libraries] #13151: Graph dominiator tree considers unvisited vertices

Subject: [Boost-bugs] [Boost C++ Libraries] #13151: Graph dominiator tree considers unvisited vertices
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2017-08-09 10:26:12

#13151: Graph dominiator tree considers unvisited vertices
----------------------------------+-------------------------------
 Reporter:  scott.gregory.west@…  |      Owner:  Jeremiah Willcock
     Type:  Bugs                  |     Status:  new
Milestone:  To Be Determined      |  Component:  graph
  Version:  Boost 1.64.0          |   Severity:  Problem
 Keywords:                        |
----------------------------------+-------------------------------
 The graph dominator tree will consider vertices that are not reachable
 from the given root. The unreachable check is implemented checking "dfnum
 < 0 || dfnum >= numOfVertices", but the dfnum map is initialized to 0. So
 when nodes are really unvisited they will have a value of 0 and pass the
 check.

 Simple fix could be:
 https://github.com/boostorg/graph/pull/97

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