<span class="e" id="q_111e0a07d77dc8c4_0"><span class="gmail_quote"></span>Hi all,<br>I&#39;m relatively new with BGL and I&#39;m looking for a ready to use tools to detect a subgraph isomorphism inside a graph. <br>Precisely, given a template graph T and a test graph G, I&#39;d like to detect all the subgraph of G that match exactly the&nbsp; 
template T. <br>I found an implemation that seems to solve this problem here :<br><br><a href="http://www.mail-archive.com/boost@lists.boost.org/msg06380.html" target="_blank" onclick="return top.js.OpenExtLink(window,event,this)">

http://www.mail-archive.com/boost@lists.boost.org/msg06380.html
</a><br><br></span>But, I&#39;m not very familiar with the BGL
interface and this code lacks&nbsp; of documentation. So, maybe there&#39;s
someone that already use this code and can explain me more about the
template parameters the this function need (esplecialy the
EdgeLabeling&nbsp; template&nbsp; and&nbsp; the VertexLabeling template).
<br><br>Otherwise, is there any&nbsp; ready to use&nbsp; algorithme insind BGL
that can do this. The implementation above exists since 2003 and may be
it&#39;s now a part of BGL ???<br><br>Regards,<br><span class="sg"><br>Jaonary&nbsp;  </span>