| Index | index by Group | index by Distribution | index by Vendor | index by creation date | index by Name | Mirrors | Help | Search |
| Name: nauty | Distribution: openSUSE Tumbleweed |
| Version: 2.8.9 | Vendor: openSUSE |
| Release: 2.1 | Build date: Sun Jun 22 23:03:59 2025 |
| Group: Productivity/Scientific/Math | Build host: reproducible |
| Size: 4738982 | Source RPM: nauty-2.8.9-2.1.src.rpm |
| Packager: http://bugs.opensuse.org | |
| Url: https://pallini.di.uniroma1.it/ | |
| Summary: Tools for computing automorphism groups of graphs | |
nauty and Traces are programs for computing automorphism groups of graphs and digraphs (*Traces does not accept digraphs at this time). 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.
Apache-2.0
* Sun Jun 22 2025 Jan Engelhardt <jengelh@inai.de>
- Add gcc15.patch
* Sun Feb 09 2025 Jan Engelhardt <jengelh@inai.de>
- Update to release 2.8.9
* There is a new utility uniqg for filtering by isomorphism
class. Use `uniqg --help` for full instructions.
* Fri May 17 2024 Jan Engelhardt <jengelh@inai.de>
- Add autoconf-2.72.patch
* Tue Nov 21 2023 Jan Engelhardt <jengelh@inai.de>
- Update to release 2.8.8
* `deledgeg` has a new option -v for removing only edges incident
to a particular vertex.
* `countneg` is a new utility for counting graphs by their number
of edges and/or vertices. Faster than countg, but does not
support sparse6 input or count'gs -p and -f options.
* `genspecialg` has a new option -X which can select one of 126
named graphs.
* countg/pickg: The chromatic number is selected by -N and the
chromatic index by -NN.
* countg/pickg: Connectivity is selected by -G and the
edge-connectivity by -GG.
* `genbg` got faster for trees
* Don Knuth's 30-bit random number generator has been replaced by
George Marsaglia's 64-bit random number generator.
* `genktreeg` is a new generator for making k-trees.
* `ransubg` is a new tool that extracts a random
subgraph/subdigraph from an input graph. It can make random
orientations.
* `geng -p` will exclude graphs with 5-cycles.
* Sun Dec 11 2022 Stefan Brüns <stefan.bruens@rwth-aachen.de>
- Update to release 2.8.6
* New utilities:
* addptg: add additional vertices in various ways
* ancestorg: removes a specified number of final vertices
* productg: product of two graphs
* genposetg: generate posets
* dimacs2g: read files of graphs in DIMACS format
* For a detailed list of changes, see included changes24-28.txt
* Changes to existing utilities:
* geng got sigificantly faster for connected graphs with a
small number of edges. However, if you want trees the program
gentreeg is still much faster. There are also new options:
* -k: generate graphs without K4
* -T: generate chordal graphs
* -S: generate split graphs
* -P: generate perfect graphs
* -F: generate claw-free graphs
- Rebase nauty-uninitialized.diff and nauty-am.diff.
* Sat Jul 16 2022 Jan Engelhardt <jengelh@inai.de>
- Update to release 2.7.4
* Fixed an obscure bug in multig that might occur if the input
graph has loops. No example of incorrect behaviour is known.
* Sun Sep 27 2020 Bernhard Wiedemann <bwiedemann@suse.com>
- Disable lzcnt instruction to make build reproducible (boo#1100677)
* Mon Sep 07 2020 Jan Engelhardt <jengelh@inai.de>
- Update to release 2.7.1
* The -B/--B switch of listg/countg is now
isomomorphism-invariant.
* Sat Aug 24 2019 Jan Engelhardt <jengelh@inai.de>
- Update to new upstream release 2.7~rc2
* -h and -k options for independent set size and clique size
were added to countg and pickg. For some graphs these use the
program cliquer.
* Added option -a to complg.
* Program copyg can now be used to make a simple filter.
* Programs countg and pickg can now display some parameter values
as ranges instead of writing a separate line for each value.
* Program vcolg now handles digraphs and graphs with loops.
* genrang can now make random spanning trees of K(n1,n2)
* amtog has an "s" command for reading tournaments
* genspecialg can now make multiple special graphs at once.
The -b option has been extended to allow removing a matching
from a complete bipartite graph.
* See /usr/share/doc/packages/nauty/changes24-27.txt for details.
* Thu Oct 25 2018 Jan Engelhardt <jengelh@inai.de>
- Update to new upstrem release 2.6.11
* No changelog was provided
/usr/bin/NRswitchg /usr/bin/addedgeg /usr/bin/amtog /usr/bin/assembleg /usr/bin/biplabg /usr/bin/catg /usr/bin/checks6 /usr/bin/complg /usr/bin/converseg /usr/bin/copyg /usr/bin/countg /usr/bin/countneg /usr/bin/cubhamg /usr/bin/deledgeg /usr/bin/delptg /usr/bin/directg /usr/bin/dreadnaut /usr/bin/dretodot /usr/bin/dretog /usr/bin/edgetransg /usr/bin/genbg /usr/bin/genbgL /usr/bin/geng /usr/bin/gengL /usr/bin/genktreeg /usr/bin/genquarticg /usr/bin/genrang /usr/bin/genspecialg /usr/bin/gentourng /usr/bin/gentreeg /usr/bin/hamheuristic /usr/bin/labelg /usr/bin/linegraphg /usr/bin/listg /usr/bin/multig /usr/bin/newedgeg /usr/bin/pickg /usr/bin/planarg /usr/bin/ranlabg /usr/bin/ransubg /usr/bin/shortg /usr/bin/showg /usr/bin/subdivideg /usr/bin/twohamg /usr/bin/underlyingg /usr/bin/uniqg /usr/bin/vcolg /usr/bin/watercluster2 /usr/share/doc/packages/nauty /usr/share/doc/packages/nauty/changes24-28.txt /usr/share/licenses/nauty /usr/share/licenses/nauty/COPYRIGHT
Generated by rpm2html 1.8.1
Fabrice Bellet, Thu Oct 9 23:24:20 2025