Also re:Kam1n0, graph isomorphism may be NP-complete, so claiming to do it efficiently is eyebrow-raising.