funkdigen2 1.1.0

This release adds the rather technical command line option --lcs (or -b), which internally switches to Booth’s LCS algorithm when establishing wether a sequence is its own minimal rotation. This does not change the actual output of the program in any way.

This seems to be slower or equivalent to the default (naive) algorithm for any number of vertices (up to 255) on our test machine, even though we only tested it by generating a small subset of functional digraphs with a “large” number of vertices, of course. We include this option anyway because:

• it might actually work faster on your machine (let us know if it is the case!);
• this implements the actual $O(n^3)$-delay algorithm described in the paper, rather than a $O(n^4)$ one, which might be useful for research-related reasons.

funkdigen2 1.0.0

The first stable release of funkdigen2, the efficient generator of functional digraphs.

funkdigen2 1.0.0-beta.2

For the second beta of funkdigen2 we have:

• Optional removal of self-loops before printing, which allows the output to be compared to geng + watercluster2
• …showing that it is indeed the same modulo relabelling with labelg and sorting, at least until n = 15 vertices
• Experimental runtime comparison with geng + watercluster2

funkdigen2 1.0.0-beta

Here is the first beta of funkdigen2:

• Way more efficient (about 2 orders of magnitude on one particular machine!) than funkdigen
• digraph6 output format by default, compatible with the nauty & Traces tools
• Old internal output format (slightly faster) still available with the command-line option -i
• Precompiled binaries available for various machines and operating systems