[Nauty] canonical label for directed graphs

[Sterten at aol.com]

yes, you can just do this with the latest version of Nauty.
The old discussion was because in some cases on large graphs
it could be slower than converting it to undirected.
I usually convert to undirected.
 
-------------------------
 
In einer eMail vom 25.08.2005 11:38:55 Westeuropäische Sommerzeit schreibt  
ent03r at ecs.soton.ac.uk:

Thanks  for the pointers so far..

The adjacency matrix of directed graphs may  not be symmetric, as opposed
to symmetric adj matrices for undirected  graphs, which always are. By
considering the whole adj matrix during  computation of the canonical
label, would we have a way of computing  canonical labels of directed
graphs without any need for converting them to  undirected ones in the
first place, or not?

Cheers,  Edward.