openSUSE Build Service

Overview Repositories Revisions Requests Users Attributes Meta

File nauty.changes of Package nauty (Revision 18080a8073104570c47ef34656c444c1)

Currently displaying revision 18080a8073104570c47ef34656c444c1 , Show latest

-------------------------------------------------------------------
Fri May 17 06:22:51 UTC 2024 - Jan Engelhardt <jengelh@inai.de>

- Add autoconf-2.72.patch

-------------------------------------------------------------------
Tue Nov 21 21:50:25 UTC 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 19:13:11 UTC 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 22:20:20 UTC 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 19:34:39 UTC 2020 - Bernhard Wiedemann <bwiedemann@suse.com>

- Disable lzcnt instruction to make build reproducible (boo#1100677)

-------------------------------------------------------------------
Mon Sep  7 12:37:20 UTC 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 16:40:41 UTC 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 10:11:59 UTC 2018 - Jan Engelhardt <jengelh@inai.de>

- Update to new upstrem release 2.6.11
  * No changelog was provided

-------------------------------------------------------------------
Mon Jul 30 03:57:10 UTC 2018 - bwiedemann@suse.com

- Disable popcnt instruction to make build reproducible (boo#1100677)

-------------------------------------------------------------------
Mon Apr 30 22:26:29 UTC 2018 - jengelh@inai.de

- Update to new upstream release 2.6.10
  * Problems with input of graphs with 0 vertices were fixed.
    Many utilities in the package will not work with such graphs.
    It is NOT TRUE that graphs of order 0 are now supported.
  * Stronger measures are taken to ensure that the sort order
    used by shortg is plain byte order. This corresponds to the C
    collation order, also known as POSIX, but it may be different
    from the collation order used by default on your command
    line. This means that utilities like sort, uniq, comm and
    join might consider the output of shortg to be out of order.
    To avoid this, define the environment variable LC_ALL to
    equal the string "C":
  * bash: export LC_ALL=C
  * tcsh: setenv LC_ALL C
  * If LC_ALL is undefined, it will also be sufficient to define
    LC_COLLATE to equal "C". The POSIX standard says that LC_ALL
    takes precedence over LC_COLLATE if both are defined, but
    this might not be true for older systems.

-------------------------------------------------------------------
Thu Sep 14 19:26:13 UTC 2017 - jengelh@inai.de

- Update to new upstream release 2.6.7;
  initial version for build.opensuse.org
  * Switch from Non-Commercial Non-Military license to Apache-2.0
  * The "dreadnaut" tool now catches control-C when nauty or Traces
    is running. This uses the global variable nauty_kill_request.
  * dreadnaut: new command "vv" to display sorted degree sequence.
  * dreadnaut: new command "r&" to relabel according to the
    partition.
  * dreadnaut: new command "->>" to flush the output.
  * dreadnaut: new command "B" to turn on output flushing at the
    end of every command. Command "-B" turns it off. Default off.
  * dreadnaut: Command with short arguments now have to be all on
    one line. Most errors cause the rest of the input line to be
    skipped.
  * dreadnaut: The "R" command now preserves the colouring.
  * The "nauty" tool has an extra hook usercanonproc().
  * nauty: The maximum number of vertices is now 2 billion.
- Add nauty-am.diff, nauty-uninitialized.diff

-------------------------------------------------------------------
Sat May 18 13:48:53 UTC 2013 - jengelh@inai.de

- Initial package (version 2.5.3)

Places

File nauty.changes of Package nauty (Revision 18080a8073104570c47ef34656c444c1)

Places