I was wondering if anybody knows where I can find some information about the current (practical) algorithms for finding graph isomorphisms. I've joined the bandwagon and wrote my own which I would like to compare with the others.
To compare your implementation with others, I would recommend to benchmark it against
igraph and McKay's canonical labelling (IIRC part of the
nauty package). The last two are optional packages in sage, so probably installing sage (possibly in a virtual machine) is the easiest way.