File perl-Graph.changes of Package perl-Graph
-------------------------------------------------------------------
Sat Oct 10 08:58:47 UTC 2015 - coolo@suse.com
- updated to 0.9704
see /usr/share/doc/packages/perl-Graph/Changes
0.9704 2015-10-07 Jarkko Hietaniemi <jhi@iki.fi>
- rt.cpan.org 107567: edges() missing on undirected multiedged graph:
was broken in 0.96, had been fixed somewhere there and here,
added the test case
- rt.cpan.org 107600: no modify Storable $VERSION
-------------------------------------------------------------------
Fri Oct 2 09:08:25 UTC 2015 - coolo@suse.com
- updated to 0.9703
see /usr/share/doc/packages/perl-Graph/Changes
0.9703 2015-09-29 Jarkko Hietaniemi <jhi@iki.fi>
- document (at user level) the openbsd random problem
- using the 5.22+ Inf was done the wrong way:
https://github.com/neilbowers/Graph/issues/1
0.9702 2015-09-28 Jarkko Hietaniemi <jhi@iki.fi>
- rt.cpan.org 107394 $Storable::VERSION may contain underscores
- follow-up to rt.cpan.org 104687: more docs, fixes, and tests for
diameter/radius/shortest_path/center_vertices/vertex_eccentricity
for corner cases like empty graph, single-vertex graphs, and
in general unconnected graphs
- for perl 5.22 or later one should be able to use Inf for Infinity
- openbsd before perl 5.20 had nondeterministic rand()
-------------------------------------------------------------------
Wed Sep 23 08:40:24 UTC 2015 - coolo@suse.com
- updated to 0.97
see /usr/share/doc/packages/perl-Graph/Changes
-------------------------------------------------------------------
Wed Jun 5 05:50:19 UTC 2013 - coolo@suse.com
- updated to 0.96
* Address rt.cpan.org #85449:
"Graph-0.94 tests fail under perl 5.18.0"
* Address rt.cpan.org #82324:
"Test failures due to hash randomisation in perl 5.17.6"
The two above fixes were the same: the biconnectedness
code was rewritten from scratch. The new code behaves
differently (but I believe more correctly) on certain
edge cases, in general it will generate more biconnected
components and bridges, for example for "a=b=c" it will
now return the same two biconnected components and bridges
(cut edges), namely "a=b" and "b=c", the "b" of course being
the articulation point (cut vertex).
* Address rt.cpan.org #67213:
"[PATCH] pod fixes"
* Remove the t/u_bo.t and t/u_bo1.t since they die in 5.18 due
to some strange failure, looks unrelated to Graph as such,
probably some fix/change made by newer Perls.
* Release as 0.95.
-------------------------------------------------------------------
Fri Nov 18 11:10:38 UTC 2011 - coolo@suse.com
- use original .tar.gz
-------------------------------------------------------------------
Tue Nov 30 19:20:17 UTC 2010 - coolo@novell.com
- switch to perl_requires macro
-------------------------------------------------------------------
Mon Aug 2 15:36:23 UTC 2010 - chris@computersalat.de
- initial package 0.94
* created by cpanspec 1.78
