title: VF2 (or other) graph isomorphism implementation in Java
body: <blockquote>
    <p><strong>Possible Duplicate:</strong><br>
    <a href="https://stackoverflow.com/questions/4600787/vf2-subgraph-isomorphism">VF2 Subgraph Isomorphism</a>  </p>
  </blockquote>
  
  
  
  <p>I want to implement graph isomorphism algorithm in Java but I face a lot of problems due to small programming experience (maybe logic as well). After some research I found that three heuristic algorithms are available: Ullman, Nauty and VF2. VF2 is considered fastest and simplest to implement as I was told by some PhD student. I read the paper devoting to VF2 but unfortunately don't understand how it works (in code) and what to do with feasibility rules.
  A lot of guys here refer to C++ code implementation, but unfortunately, the link doesn't open.
  Furthermore, one user (Rich Apodaca) suggested to look at his implementation (MX) of VF2 for chemists but didn't point out which files, just big project...
  Please help me to implement isomorphism algorithm in java (better VF2 because of speed) and point out to working code (not the whole project, it is hard for me to understand the structure) in Java or C++ (which I don't know but at least I can try).
  Thank you.</p>