[Nauty] Version 2.2 beta 3 released; future things

[Brendan McKay]

* Sterten at aol.com <Sterten at aol.com> [021120 19:24]:
> 
> sometimes you don't have the edges explicitely, but a numerical

Yes, implicit graphs, good idea.

> what about directed graphs and graphs with loops ?
> I.e. any relation = n*n matrix with entries from {0,1} .
> That's a natural generalization IMO and maybe some or most
> undirected routines can be generalized.

They are handled already.  Using nauty from a program, set
options.digraph=TRUE.  With dreadnaut, use the 'd' command.

Brendan.