Re: [Boost-users] Graph Permutations of Order n

From: John Reid (j.reid_at_[hidden])
Date: 2007-07-20 11:01:57

A graph of order n has up to k=n(n-1)/2 possible edges so you could 
count from 0 to 2^k and add/remove edges as you go according to which 
bits in your counting variable are set. Hope that's clear.

John.

Brian Stadler wrote:
> Hi list,
> 
> I'm attempting to create all graphs of order n, isomorphic graphs and 
> all.  Basically, with vertices V and Edges E, permutate through all 
> possible variations.  Does anyone on this list know of a simple way to 
> do this with the boost graph library or, can point to some location that 
> may help.
> 
> thanks
> 
> 
> ------------------------------------------------------------------------
> 
> _______________________________________________
> Boost-users mailing list
> Boost-users_at_[hidden]
> http://lists.boost.org/mailman/listinfo.cgi/boost-users