|
Boost Users : |
From: Paolo Fosser (pfosser_at_[hidden])
Date: 2002-12-04 03:29:57
Hi all,
I'm using BGL in some graph matching algorithms. Now I have to
shuffle a bit one of the graphs I'm comparing. I think it all ends up in
considering the nodes in a different order when cycling on them. (BTW am
I right?). So my question: is there an elegant way to do this in BGL?
The only solution that comes into my mind is to build up a map from the
range of vertex descriptors to a permutation of them.
TIA,
Paolo
-- Do you want to live forever? Alex Chiu has invented a device which will give you physical immortality. Click here! http://www.alexchiu.com/affiliates/clickthru.cgi?id=pfosser
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net