pkgsrc/devel/p5-Graph/distinfo
wen d9bf00846b Update to 0.96
Upstream changes:
2013-05-24  Jarkko Hietaniemi  <jhi@iki.fi>

	* Mop-up release for 0.95.  Still is and will be unsupported.

	* Release as 0.96.

2013-05-23  Jarkko Hietaniemi  <jhi@iki.fi>

	* 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.
2013-05-27 13:54:06 +00:00

5 lines
234 B
Text

$NetBSD: distinfo,v 1.10 2013/05/27 13:54:06 wen Exp $
SHA1 (Graph-0.96.tar.gz) = c2c1b9a6725706757d6eaf54ca85997843d340aa
RMD160 (Graph-0.96.tar.gz) = 254f42f014381f6002a9bafcc71c1d791b95d5e8
Size (Graph-0.96.tar.gz) = 147629 bytes