|
Boost Users : |
Subject: [Boost-users] [BGL] Assertion failed / memory leak in r_c_shortest_paths.hpp
From: Alberto Santini (santini.alberto_at_[hidden])
Date: 2015-10-08 05:35:41
In the following 2-years old thread, a memory leak was experienced when
using r_c_shortest_paths of the boost graph library. Jeremiah Willcock
added a bunch of assertions to the code, to help identify the problem.
https://groups.google.com/forum/#!topic/boost-list/W1muJiw85pA
I think I now have a reproducible version of this, which I believe might be
a bug. I would like some input before opening a bug report.
Here is the gist:
https://gist.github.com/alberto-santini/32c19530dcefb784d0f2
It contains:
1) graph.txt which contains a dump of the graph that exposes the problem
2) boost_bug.cpp which is the code used to build the graph from file and
do the labelling
3) terminal_output.txt which contains the command used to compile and
what happens when running the code
It has been tested on Mac OS X 10.11 with GCC 5.2 and Boost 1.58. The
programme doesn't necessary trigger the assertion at each run. There are
runs in which it completes successfully, runs in which it segfaults without
triggering any assertion and times in which it's aborted by the failed
assertion.
The failed assertion is:
Assertion failed: (p_cur_label->b_is_valid), function
r_c_shortest_paths_dispatch, file
/usr/local/include/boost/graph/r_c_shortest_paths.hpp, line 472.
I would like to know if you experience the same behaviour and can confirm
(or at least make an educated guess) wether or not this is a bug in
r_c_shortest_paths.hpp.
Thanks,
AS
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net