Script 'mail_helper' called by obssrc Hello community, here is the log from the commit of package perl-Graph for openSUSE:Factory checked in at 2021-04-22 18:04:48 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Comparing /work/SRC/openSUSE:Factory/perl-Graph (Old) and /work/SRC/openSUSE:Factory/.perl-Graph.new.12324 (New) ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Package is "perl-Graph" Thu Apr 22 18:04:48 2021 rev:24 rq:887834 version:0.9721 Changes: -------- --- /work/SRC/openSUSE:Factory/perl-Graph/perl-Graph.changes 2021-04-12 12:39:30.329518602 +0200 +++ /work/SRC/openSUSE:Factory/.perl-Graph.new.12324/perl-Graph.changes 2021-04-22 18:06:25.710740749 +0200 @@ -1,0 +2,9 @@ +Mon Apr 19 03:07:02 UTC 2021 - Tina M??ller <[email protected]> + +- updated to 0.9721 + see /usr/share/doc/packages/perl-Graph/Changes + + 0.9721 2021-04-18 + - fix BitMatrix and AdjacencyMatrix problems - thanks @dod38fr for report + +------------------------------------------------------------------- Old: ---- Graph-0.9720.tar.gz New: ---- Graph-0.9721.tar.gz ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Other differences: ------------------ ++++++ perl-Graph.spec ++++++ --- /var/tmp/diff_new_pack.832piF/_old 2021-04-22 18:06:26.202741563 +0200 +++ /var/tmp/diff_new_pack.832piF/_new 2021-04-22 18:06:26.206741570 +0200 @@ -18,7 +18,7 @@ %define cpan_name Graph Name: perl-Graph -Version: 0.9720 +Version: 0.9721 Release: 0 Summary: Graph data structures and algorithms License: Artistic-1.0 OR GPL-1.0-or-later ++++++ Graph-0.9720.tar.gz -> Graph-0.9721.tar.gz ++++++ diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/Graph-0.9720/Changes new/Graph-0.9721/Changes --- old/Graph-0.9720/Changes 2021-03-25 20:57:19.000000000 +0100 +++ new/Graph-0.9721/Changes 2021-04-18 14:30:24.000000000 +0200 @@ -1,3 +1,6 @@ +0.9721 2021-04-18 +- fix BitMatrix and AdjacencyMatrix problems - thanks @dod38fr for report + 0.9720 2021-03-25 - better fix - no mutate inputs diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/Graph-0.9720/META.json new/Graph-0.9721/META.json --- old/Graph-0.9720/META.json 2021-03-25 20:57:52.000000000 +0100 +++ new/Graph-0.9721/META.json 2021-04-18 14:31:32.000000000 +0200 @@ -68,6 +68,6 @@ "web" : "https://github.com/graphviz-perl/Graph"; } }, - "version" : "0.9720", + "version" : "0.9721", "x_serialization_backend" : "JSON::PP version 4.04" } diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/Graph-0.9720/META.yml new/Graph-0.9721/META.yml --- old/Graph-0.9720/META.yml 2021-03-25 20:57:52.000000000 +0100 +++ new/Graph-0.9721/META.yml 2021-04-18 14:31:32.000000000 +0200 @@ -30,5 +30,5 @@ resources: bugtracker: https://github.com/graphviz-perl/Graph/issues repository: git://github.com/graphviz-perl/Graph.git -version: '0.9720' +version: '0.9721' x_serialization_backend: 'CPAN::Meta::YAML version 0.018' diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/Graph-0.9720/lib/Graph/AdjacencyMatrix.pm new/Graph-0.9721/lib/Graph/AdjacencyMatrix.pm --- old/Graph-0.9720/lib/Graph/AdjacencyMatrix.pm 2021-01-03 07:28:36.000000000 +0100 +++ new/Graph-0.9721/lib/Graph/AdjacencyMatrix.pm 2021-04-18 14:25:30.000000000 +0200 @@ -29,31 +29,22 @@ my $m = Graph::BitMatrix->new($g); my $self = bless [ $m, undef, \@V ], $class; return $self if !$want_distance; - # for my $u (@V) { - # for my $v (@V) { - # if ($g->has_edge($u, $v)) { - # $n->set($u, $v, - # $g->get_edge_attribute($u, $v, $d)); - # } - # } - # } my $n = $self->[ _DM ] = Graph::Matrix->new($g); $n->set($_, $_, 0) for @V; - my $Ei = $g->[_E][_i]; my $n0 = $n->[0]; my $n1 = $n->[1]; my $undirected = $g->is_undirected; my $multiedged = $g->multiedged; - for my $t (grep defined, @$Ei) { - my ($i0, $j0) = @$t; - my $u = $V[ $i0 ]; - my $v = $V[ $j0 ]; - $n0->[ $i0 ]->[ $j0 ] = $multiedged + for my $e ($g->edges) { + my ($u, $v) = @$e; + $n->set($u, $v, $multiedged ? _multiedged_distances($g, $u, $v, $d) - : $g->get_edge_attribute($u, $v, $d); - $n0->[ $j0 ]->[ $i0 ] = $multiedged + : $g->get_edge_attribute($u, $v, $d) + ); + $n->set($v, $u, $multiedged ? _multiedged_distances($g, $v, $u, $d) - : $g->get_edge_attribute($v, $u, $d) if $undirected; + : $g->get_edge_attribute($v, $u, $d) + ) if $undirected; } $self; } diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/Graph-0.9720/lib/Graph/BitMatrix.pm new/Graph-0.9721/lib/Graph/BitMatrix.pm --- old/Graph-0.9720/lib/Graph/BitMatrix.pm 2021-01-08 14:13:18.000000000 +0100 +++ new/Graph-0.9721/lib/Graph/BitMatrix.pm 2021-04-18 14:23:19.000000000 +0200 @@ -28,19 +28,12 @@ # vec($bm0->[$i], $j, 1) = 1 if $g->has_edge($u, $V[$j]); # } # } - my $Ei = $g->[_E]->[_i]; - if ($g->is_undirected) { - for my $e (grep defined, @{ $Ei }) { - my ($i0, $j0) = @$e; - vec($bm0->[$i0], $j0, 1) = 1; - vec($bm0->[$j0], $i0, 1) = 1; - } - } else { - for my $e (grep defined, @{ $Ei }) { - my ($i0, $j0) = @$e; - ($j0, $i0) = ($i0, $j0) if $transpose; - vec($bm0->[$i0], $j0, 1) = 1; - } + my $undirected = $g->is_undirected; + for my $e ($g->edges) { + my ($i0, $j0) = map $V{$_}, @$e; + ($j0, $i0) = ($i0, $j0) if $transpose; + vec($bm0->[$i0], $j0, 1) = 1; + vec($bm0->[$j0], $i0, 1) = 1 if $undirected; } $bm; } diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/Graph-0.9720/lib/Graph.pm new/Graph-0.9721/lib/Graph.pm --- old/Graph-0.9720/lib/Graph.pm 2021-03-25 20:57:26.000000000 +0100 +++ new/Graph-0.9721/lib/Graph.pm 2021-04-18 14:30:36.000000000 +0200 @@ -14,7 +14,7 @@ use Graph::AdjacencyMap qw(:flags :fields); -our $VERSION = '0.9720'; +our $VERSION = '0.9721'; require 5.006; # Weak references are absolutely required. @@ -317,6 +317,7 @@ sub _vertex_ids_maybe_ensure { my $ensure = pop; my ($g, @args) = @_; + __carp_confess "Graph: given undefined vertex" if grep !defined, @args; my $V = $g->[ _V ]; my $deep = &is_hyperedged && &is_directed; return $V->get_ids_by_paths(\@args, $ensure, $deep) if ($V->[ _f ] & _REF) or $deep; diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/Graph-0.9720/t/72_transitive.t new/Graph-0.9721/t/72_transitive.t --- old/Graph-0.9720/t/72_transitive.t 2021-03-25 20:47:57.000000000 +0100 +++ new/Graph-0.9721/t/72_transitive.t 2021-04-18 14:25:21.000000000 +0200 @@ -515,4 +515,15 @@ ok $tcg->is_reachable(7, 8), '7-8 reachable when on cycle'; } +{ + my $g = Graph::Directed->new(edges => [ + [qw(A C)], [qw(A NOTA)], [qw(B A)], [qw(B C)], [qw(B NOTA)], + ]); + $g->delete_vertex('C'); + my $tc = $g->transitive_closure; + is $tc, 'A-A,A-NOTA,B-A,B-B,B-NOTA,NOTA-NOTA'; + $tc->delete_edge($_,$_) for qw(A B C N); + is $tc, 'A-NOTA,B-A,B-NOTA,NOTA-NOTA'; +} + done_testing; diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/Graph-0.9720/t/83_bitmatrix.t new/Graph-0.9721/t/83_bitmatrix.t --- old/Graph-0.9720/t/83_bitmatrix.t 2021-01-03 07:28:36.000000000 +0100 +++ new/Graph-0.9721/t/83_bitmatrix.t 2021-04-18 14:23:06.000000000 +0200 @@ -6,10 +6,12 @@ my $g = Graph->new; +$g->add_edge(qw(e a)); $g->add_edge(qw(a b)); $g->add_edge(qw(b c)); $g->add_edge(qw(b d)); $g->add_edge(qw(d d)); +$g->delete_vertex('e'); my $m = Graph::BitMatrix->new($g);
