Changelog for nauty-2.8.9-1.1.i586.rpm :

* Sun Feb 09 2025 Jan Engelhardt - 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 - Add autoconf-2.72.patch
* Tue Nov 21 2023 Jan Engelhardt - 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 - 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 - 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 - Disable lzcnt instruction to make build reproducible (boo#1100677)
* Mon Sep 07 2020 Jan Engelhardt - Update to release 2.7.1
* The -B/--B switch of listg/countg is now isomomorphism-invariant.
* Sat Aug 24 2019 Jan Engelhardt - 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 - Update to new upstrem release 2.6.11
* No changelog was provided
* Mon Jul 30 2018 bwiedemannAATTsuse.com- Disable popcnt instruction to make build reproducible (boo#1100677)