nauty-2.9.3-1.2 RPM for x86_64

From OpenSuSE Tumbleweed for x86_64

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.

Provides

• nauty
• nauty(x86-64)

Requires

• libc.so.6()(64bit)
• libc.so.6(GLIBC_2.14)(64bit)
• libc.so.6(GLIBC_2.2.5)(64bit)
• libc.so.6(GLIBC_2.3)(64bit)
• libc.so.6(GLIBC_2.3.4)(64bit)
• libc.so.6(GLIBC_2.34)(64bit)
• libc.so.6(GLIBC_2.38)(64bit)
• libc.so.6(GLIBC_2.4)(64bit)
• libm.so.6()(64bit)
• libm.so.6(GLIBC_2.2.5)(64bit)
• libnauty-2.9.3.so()(64bit)
• libnautyA1-2.9.3.so()(64bit)
• libnautyL1-2.9.3.so()(64bit)
• libnautyW1-2.9.3.so()(64bit)
• rpmlib(CompressedFileNames) <= 3.0.4-1
• rpmlib(FileDigests) <= 4.6.0-1
• rpmlib(PartialHardlinkSets) <= 4.0.4-1
• rpmlib(PayloadFilesHavePrefix) <= 4.0-1
• rpmlib(PayloadIsZstd) <= 5.4.18-1

License

Apache-2.0

Changelog

* Tue Feb 03 2026 Jan Engelhardt <jengelh@inai.de>
  - Update to release 2.9.3
    * The `-r` and `-R` switches in complg were badly broken for a
      long time. The core functionality of complg was fine, however.
      As well as fixing this problem, complg has a new switch `-S`
      that outputs only the input graphs that are self-complementary.
    * vcolg has a new switch ``-F#`` that says to use the group that
      fixes the first n(#) vertices setwise and also to use only
      colour 0 on the first n vertices.
    * genrang has a new switch `-G#` that provides an approximation
      of random unlabelled graphs. The greater the parameter, the
      better the approximation and the worse the efficiency. In
      particular graphs whose automorphism groups have order at most
      [#] come out in the correct relative proportions.
    * uniqg has a new switch `-J` that writes 32-byte hash codes as
      lines ending with LF newline. Note that it is still binary, but
      now it is good for sorting.
    * A labelling error with Traces when an initial partition is
      specified was corrected. A minor standards violation with
      memcpy was also fixed.
    * `cubhamg -V -c` now displays all hamiltonian cycles. In
      addition, cubhamg has a facility for user-written code to be
      called for each cycle.
* Sat Oct 11 2025 Jan Engelhardt <jengelh@inai.de>
  - Update to release 2.9.1
    * pickg/countg --HH counts hexagons (6-cycles) in undirected
      graphs.
    * Fixed pickg/countg documentation for colouring parameters.
    * pickg/countg -Y works faster if an low upper limit is given.
    * Added "c" option to genposetg to select only connected
      posets.
    * countneg -n (but not -e) can now handle incremental sparse
      format.
    * The space efficiency of uniqg has improved to 48 bytes per
      isomorphism class.
    * listg -T writes a one-line format like 0--1,2--3,... as
      required by the program 'tutte'.
    * dreadnaut: The options related to invariants have been
      separated into options for digraphs and options for
      undirected graphs. See online changelog for details.
  - Delete nauty-uninitialized.diff (merged)
* 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.

Files

/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-29.txt
/usr/share/licenses/nauty
/usr/share/licenses/nauty/COPYRIGHT

Generated by rpm2html 1.8.1

Fabrice Bellet, Fri Jul 24 15:27:28 2026