Paolo, would you please provide a little more information. For starters, are you comparing graphs to determine differences in topology, attached edge/vertex properties, or both? Can we assume both BGL graphs are based on adjacency_list and store their edges/vertices in the same type of STL containers? Also, can we assume identical property map semantics? - Chris "Paolo Fosser" <pfosser@supereva.it> wrote in message news:3DEDBD05.46E3F692@dsi.unive.it...
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
Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com>
Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/