Hi all, I'm relatively new with BGL and I'm looking for a ready to use tools to detect a subgraph isomorphism inside a graph. Precisely, given a template graph T and a test graph G, I'd like to detect all the subgraph of G that match exactly the template T. I found an implemation that seems to solve this problem here : http://www.mail-archive.com/boost@lists.boost.org/msg06380.html But, I'm not very familiar with the BGL interface and this code lacks of documentation. So, maybe there's someone that already use this code and can explain me more about the template parameters the this function need (esplecialy the EdgeLabeling template and the VertexLabeling template). Otherwise, is there any ready to use algorithme insind BGL that can do this. The implementation above exists since 2003 and may be it's now a part of BGL ??? Regards, Jaonary