Go to file
Fedora Release Engineering 6051b4a634 Rebuilt for https://fedoraproject.org/wiki/Fedora_38_Mass_Rebuild
Signed-off-by: Fedora Release Engineering <releng@fedoraproject.org>
2023-01-19 21:15:53 +00:00
.gitignore New upstream version. 2018-10-07 13:45:33 -06:00
README.md Add README.md. 2022-07-18 14:11:09 -06:00
nauty-autotoolization.patch Version 2_8_6. Convert License tag to SPDX. 2022-11-17 13:47:11 -07:00
nauty-fall-off.patch Version 2_8_6. Convert License tag to SPDX. 2022-11-17 13:47:11 -07:00
nauty-fix-gt_numorbits.patch Version 2_8_6. Convert License tag to SPDX. 2022-11-17 13:47:11 -07:00
nauty-format.patch Disable popcnt support on i386 due to test failures. 2022-01-27 16:21:59 -07:00
nauty-help2man.patch Version 2_8_6. Convert License tag to SPDX. 2022-11-17 13:47:11 -07:00
nauty-includes.patch Initial import. 2016-04-21 16:40:59 -06:00
nauty-noreturn.patch Version 2_8_6. Convert License tag to SPDX. 2022-11-17 13:47:11 -07:00
nauty-popcnt.patch Version 2_8_6. Convert License tag to SPDX. 2022-11-17 13:47:11 -07:00
nauty-tool-prefix.patch Version 2_8_6. Convert License tag to SPDX. 2022-11-17 13:47:11 -07:00
nauty-unbundle-cliquer.patch Version 2_8_6. Convert License tag to SPDX. 2022-11-17 13:47:11 -07:00
nauty-uninitialized.patch Version 2_8_6. Convert License tag to SPDX. 2022-11-17 13:47:11 -07:00
nauty-zlib-dimacs2g.patch Version 2_8_6. Convert License tag to SPDX. 2022-11-17 13:47:11 -07:00
nauty.spec Rebuilt for https://fedoraproject.org/wiki/Fedora_38_Mass_Rebuild 2023-01-19 21:15:53 +00:00
sources Version 2_8_6. Convert License tag to SPDX. 2022-11-17 13:47:11 -07:00

README.md

nauty

Nauty and Traces are programs for computing automorphism groups of graphs and digraphs. (At present, Traces does not accept digraphs.) They can also produce a canonical label. They are written in a portable subset of C, and run on a considerable number of different systems.

There is a small suite of programs called gtools included in the package. For example, geng can generate non-isomorphic graphs very quickly. There are also generators for bipartite graphs, digraphs, and multigraphs, and programs for manipulating files of graphs in a compact format.