VF2 (or other) graph isomorphism implementation in Java -
possible duplicate: vf2 subgraph isomorphism i want implement graph isomorphism algorithm in java face lot of problems due small programming experience (maybe logic well). after research found 3 heuristic algorithms available: ullman, nauty , vf2. vf2 considered fastest , simplest implement told phd student. read paper devoting vf2 unfortunately don't understand how works (in code) , feasibility rules. lot of guys here refer c++ code implementation, unfortunately, link doesn't open. furthermore, 1 user (rich apodaca) suggested @ implementation (mx) of vf2 chemists didn't point out files, big project... please me implement isomorphism algorithm in java (better vf2 because of speed) , point out working code (not whole project, hard me understand structure) in java or c++ (which don't know @ least can try). thank you. try implementation used s-space project. it contains implementation of vf2. https://github.com/fozziethebeat/s-space the vf