- Boost - lists.boost.org

Re: [Boost-users] Boost Graph Library and Boehm Garbage Collector
by Stefan Strasser 02 May '05

02 May '05

(moving this to boost developer list) FBSL schrieb: > Hello > > I am having trouble to garbage-collect adjacency_list<>. I have > instanciated it with correctly garbage-collected vectors and lists (I > have copied vecS and listS definitions, and added Boehm GC's default > allocator so that they are garbage-collected). In my application I need > to dynamically allocate many graphs, but it does not work, there is a > (big) memory leak. Unfortunately, there is no template argument in > adjacency_list<> to specify Boehm GC's allocator. > you're right, the BGL uses the default new operator to allocate memory which then isn't collected of course. so this makes it effectively impossible to use BGL with boehm GC. is there a boost guideline to allocate memory only through allocators which is violated here? (the "new" which is causing the leak(or one of your leaks?) in your code is at line 278 of graph/detail/adjacency_list.hpp in version 1.32) -- Stefan Strasser

2 1

[Boost-bugs] [ boost-Bugs-1193883 ] BGL graph types do not support allocators
by SourceForge.net 02 May '05

02 May '05

Bugs item #1193883, was opened at 2005-05-02 10:48 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1193883&group_… Category: graph Group: None Status: Open Resolution: None Priority: 5 Submitted By: Douglas Gregor (dgregor) Assigned to: Douglas Gregor (dgregor) Summary: BGL graph types do not support allocators Initial Comment: adjacency_list and adjacency_matrix should have an Allocator parameter, but they don't. ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1193883&group_… ------------------------------------------------------- This SF.Net email is sponsored by: NEC IT Guy Games. Get your fingers limbered up and give it your best shot. 4 great events, 4 opportunities to win big! Highest score wins.NEC IT Guy Games. Play to win an NEC 61 plasma display. Visit http://www.necitguy.com/?r=20 _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

BGL::johnson_all_pairs_shortest_path question
by Andreas Fabri 02 May '05

02 May '05

Hello, What is the non-named parameter version of this algorithm. In the online manual it says Weight (and this is probably a typo, as there is a template parameter WeightMap). Also what are the arguments id1 and zero good for? andreas

2 2

BGL::johnson_all_pairs_shortest_path question
by Andreas Fabri 02 May '05

02 May '05

Hello, What is the non-named parameter version of this algorithm. In the online manual it says Weight (and this is probably a typo, as there is a template parameter WeightMap). Also what are the arguments id1 and zero good for? andreas

2 1

[process_jam_log] Is breaking!
by Rene Rivera 02 May '05

02 May '05

These changes: http://build.redshift-software.com:9990/RSI-SoL-Full/builds/86 Are causing the processing of the jam logs to fail, and hence the inability to post test results: http://build.redshift-software.com:9990/RSI-SoL-Full/builds/86/boost.proces… Any ideas? The full log of that particular test run is here: http://build.redshift-software.com:9990/RSI-SoL-Full/builds/86/boost.jam/0 -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com -- 102708583/icq - grafikrobot/aim - Grafik/jabber.org

1 0

[graph] graph concepts in edmunds-karp algorithm are incomplete
by Peter Billen 02 May '05

02 May '05

Hello all, I believe the required graph concepts of the Edmunds-Karp algorithm are not complete. The online documentation says the given graph has to be a VertexListGraph. I believe it also has to be a IncidenceGraph, since the algorithm uses breadth-first search, which calls the out-edges of each node successively. Since the algorithm (and all flow algorithms) work on the edges of the graph, edges are needed somewhere, so VertexListGraph cannot be enough in my opinion. Is this correct? Thanks, -- Peter

2 1

tribool namespace problem with vc-7_1
by Sebastian Pfützner 02 May '05

02 May '05

Hello, is the following code correct? #include <boost/logic/tribool.hpp> using namespace boost; using namespace boost::logic; int main() { tribool tb; tribool &rtb = tb; rtb = indeterminate; } My Visual C++ Compiler 7.1 says "INTERNAL COMPILER ERROR". If i comment out "using namespace boost;" everything works fine... -- Sebastian Pfützner s.pfuetzner(a)onlinehome.de ICQ-ID: 39965036

3 2

set_property on reverse_graph fails
by Manish Mangal 02 May '05

02 May '05

Dear Sir This is an enquiry for my post: http://lists.boost.org/MailArchives/boost/msg81724.php I did get an out-of-office reply from the assigned person. He was supposed to be back on 04-04-2005 but I have not heard back anything since that out-of-office reply. I do see a lot of activity on the boost lists, so was curious to know whether my question is being looked at? Thanks Manish Mangal Stratagen Systems 1-425.821.8454 ext. 136

2 1

BGL: Patches for documentation and examples
by Andreas Scherer 02 May '05

02 May '05

Dear group, Attached to this mail is a short patch file for several pages of the BGL documentation and for the example program city_visitor.cpp. Greetings, Andreas Scherer

2 1

setup_boostbook.sh can't download FOP
by Peter Simons 02 May '05

02 May '05

The fop-0.20.5 distribution archive has changed locations. The new home is: http://mirrors.ibiblio.org/pub/mirrors/apache/xml/fop/fop-0.20.5-bin.tar.gz The tools/boostbook/setup_boostbook.sh script that's currently in CVS tries to download the archive from the old URL, and thus fails. Peter

2 1