Re: [Boost-bugs] [Boost C++ Libraries] #11723: Memory leak (and assertion failed) in r_c_shortest_paths.hpp

Subject: Re: [Boost-bugs] [Boost C++ Libraries] #11723: Memory leak (and assertion failed) in r_c_shortest_paths.hpp
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2015-11-19 13:22:06


#11723: Memory leak (and assertion failed) in r_c_shortest_paths.hpp
-------------------------------+------------------------
  Reporter: a.santini@… | Owner: jewillco
      Type: Bugs | Status: new
 Milestone: To Be Determined | Component: graph
   Version: Boost 1.58.0 | Severity: Problem
Resolution: | Keywords: bgl, graph
-------------------------------+------------------------

Comment (by a.santini@…):

 More insights (in case anyone will ever take care of this). I think the
 problem is the following: when a label L residing at a vertex V is
 dominated by a new label L', all unprocessed labels which have L as
 predecessor will now point to a deallocated L. I believe they should,
 instead, be rebased so to have L' as their predecessor.

 It's not clear to me if such a situation (a label that has been extended
 is now dominated) is pathological or not.

 See the modified r_c_shortest_paths.hpp [[https://gist.github.com/alberto-
 santini/13b497601967ee72bd1d|here]] (grep for the parts nearby
 "\tWARNING"). This files prints to std::cerr some debug info.

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

This archive was generated by hypermail 2.1.7 : 2017-02-16 18:50:19 UTC