6 Jan
2011
6 Jan
'11
11:53 a.m.
At Wed, 5 Jan 2011 19:58:01 -0800, caustik wrote:
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