[Nauty-list] Two Technical questions

Brendan McKay bdm at cs.anu.edu.au
Wed Sep 27 22:04:15 EST 2006

Hi, I'm out of town at the moment and will answer q1 next week.
The answer to q2 is "none".  I recommend that people who incorporate
nauty into other general purpose code use "adjacencies" by default for
digraphs, but as yet dreadnaut does not do that.


* Chad Brewbaker <crb002 at iastate.edu> [060927 08:41]:
> I have a two technical questions about NAUTY:
> 1. Could you explain in detail the longprune() method used once per tcell in the
> depth first search? I get shortprune(), but longprune() is a little harder to
> grasp. 
> 2.Other than vanilla partition refinement what invarients does dreadnaut use by
> default? Backtracing the function pointers is a bit confusing :)
> Thanks,
> Chad Brewbaker
> _______________________________________________
> Nauty-list mailing list
> Nauty-list at cs.anu.edu.au
> http://dcsmail.anu.edu.au/cgi-bin/mailman/listinfo/nauty-list

More information about the Nauty mailing list