Boost logo

Boost :

Subject: Re: [boost] [PBGL] and [MTGL]
From: Nick Edmonds (ngedmond_at_[hidden])
Date: 2009-09-21 14:52:14

Neither currently attempt to fully support dynamic graphs, or even
incremental graphs for that matter, in the presence of concurrent
access. Both however could likely be adapted to solve your problem.
Neither will do so 'out-of-the-box'.

PBGL is unlikely to give you much of a performance boost with graphs
of this scale but may help somewhat. I outlined in the other thread
how BGL could be adapted fairly simply, adapting PBGL would only be
slightly more complex. I don't really want to go dig through the MTGL
and figure out how to adapt it to compute incremental SSSP, but it is
likely possible as well.

Feel free to ask me to expound if the details in the other thread
aren't adequate.


On Sep 21, 2009, at 11:13 AM, Cosimo Calabrese wrote:

> Hi to all,
> I open this discussion as a "branch" of "[BGL] Multithread problem
> inserting edges and exploring the same graph". Can someone tell me
> if the PBGL and MTGL can help me? I report my problem below, for
> sake of comfort.
> Thanks in advance,
> Cosimo Calabrese.
> **************************************************
> I've a problem on BGL. My environment is WinXP, Visual Studio 2005,
> Boost 1.37.
> I'm trying to use BGL in the following way. I've a single graph in
> my application, that is an adjacency_list< vecS, vecS, ... >, and
> I've 2 kind of threads that work on the graph:
> - some "Explorer" threads, that executes a Dijkstra's algorithm
> repeatedly;
> - some "Integrator" thread, that call the add_edge() function
> repeatedly.
> The program often crashes, because it cannot dereference some graph
> elements, some auto_ptr... The crash isn't sistematic, so I think
> there's a concurrency problem.
> [...]
> **************************************************
> _______________________________________________
> Unsubscribe & other changes:

Boost list run by bdawes at, gregod at, cpdaniel at, john at