On Wed, 7 Oct 2015, Nathann Cohen wrote:
If Nauty proves much better than our current implementation then that is what we will need: a fast way to call Nauty. And that means Cython.
I know nothing, but to cite Wikipedia: "There are several competing practical algorithms for graph isomorphism, due to McKay (1981) - - While they seem to perform well on random graphs, a major drawback of these algorithms is their exponential time performance in the worst case."
So maybe we should have both current algorithm and Nauty. -- Jori Mäntysalo
