|
Boost Users : |
From: Slava (slaks2005_at_[hidden])
Date: 2005-11-08 09:09:27
Hi,
I need to find Maxumum Common Subgraph (between two graphs).
For that task i need to get all the vertices of the 2 graphs sorted with some
property (like vertex label or id).
regular std::sort seems not working with vertex iterators (vertices(graph)).
What is the way to accomplish this?
Thanks
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