May be you can use concurrent data structures to represent your graph in adjacency_list < > . You could use boost::threads for accessing. But you would have to synchronize You can also use concurrent data structures provided by intel TBB and use parallel_for () for accessing elements. TBB provides good synchronization constructs. - Aniket On Wed, Feb 26, 2014 at 2:54 AM, Alexandre Motin <alexandre.motin@gmail.com>wrote:
Hello, I would like to know if BGL works in a shared memory environement. I would like to build a graph (with BGL) in a shared memory area in order to enable multiple processes to access the graph. Best regards, Alexandre Motin
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
-- Thanks and regards, Aniket Pugaonkar