[Nauty] Algorithm 2.31 in Paper "Practical Graph Isomorphism"

[Zhe Liu]

Hi Folks,

For algorithm 2.31 in paper "Practical Graph Isomorphism", is there any
revision? It seems that I have some problems with it.

For example:

if lab = false, at some point the algorithm will go into Step (11), but
here hb is not defined yet because lab = false.

Another example may be that:

At some point, the algorithm goes into Step (17) when the current node is a
terminal node, and in this case W_k is not defined.

So can anyone give me some hint?

Thanks a lot!

Best,
Zhe