NAUTY is a Graph Isomorphism(GI) software developed by Brendan McKay to test isomorphism of Graphs. It provides a practical solution to the Graph Isomorphism problem. It is a program for isomorphism and automorphism of graphs.
At the moment I am studying GI, and my query is- How does NAUTY works?
As much I understood, NAUTY uses Vertex Classification, but what happens when a Regular Graph(when Vertex Classification is meaningless) is given to NAUTY ?
It would be helpful to have an overview of NAUTY algorithm. To be precise, how it's Search Tree works?