Subject: Re: [boost] [graph_parallel] Is a distributed directed edge list possible?
From: Dave Abrahams (dave_at_[hidden])
Date: 2011-01-06 06:53:27
At Wed, 5 Jan 2011 19:58:01 -0800,
> I'm not familiar with an 'inverse graph' -- I take it that is where each
> vertex holds a list of the edges which do not exist, and assumes all others
> to exist?
That's what I had in mind, but...
> Unfortunately that would still be a problem for these graphs,
> because not every vertex will be highly connected (there are some with no
> connections, many with a few connections, any a few with many connections).
...it sounds like that might not work too well for you.
-- Dave Abrahams BoostPro Computing http://www.boostpro.com
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk