| Index | index by Group | index by Distribution | index by Vendor | index by creation date | index by Name | Mirrors | Help | Search |
| Name: perl-Graph | Distribution: SUSE Linux Enterprise 15 SP3 |
| Version: 0.9704 | Vendor: openSUSE |
| Release: bp153.1.14 | Build date: Sat Mar 6 03:39:06 2021 |
| Group: Development/Libraries/Perl | Build host: lamb54 |
| Size: 361818 | Source RPM: perl-Graph-0.9704-bp153.1.14.src.rpm |
| Packager: https://bugs.opensuse.org | |
| Url: http://search.cpan.org/dist/Graph/ | |
| Summary: Graph Data Structures and Algorithms | |
graph data structures and algorithms
Artistic-1.0 or GPL-1.0+
* Sat Oct 10 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 02 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 2015 coolo@suse.com
- updated to 0.97
see /usr/share/doc/packages/perl-Graph/Changes
* Wed Jun 05 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 2011 coolo@suse.com
- use original .tar.gz
* Tue Nov 30 2010 coolo@novell.com
- switch to perl_requires macro
* Mon Aug 02 2010 chris@computersalat.de
- initial package 0.94
* created by cpanspec 1.78
/usr/lib/perl5/vendor_perl/5.26.1/Graph /usr/lib/perl5/vendor_perl/5.26.1/Graph.pm /usr/lib/perl5/vendor_perl/5.26.1/Graph.pod /usr/lib/perl5/vendor_perl/5.26.1/Graph/AdjacencyMap /usr/lib/perl5/vendor_perl/5.26.1/Graph/AdjacencyMap.pm /usr/lib/perl5/vendor_perl/5.26.1/Graph/AdjacencyMap/Heavy.pm /usr/lib/perl5/vendor_perl/5.26.1/Graph/AdjacencyMap/Light.pm /usr/lib/perl5/vendor_perl/5.26.1/Graph/AdjacencyMap/Vertex.pm /usr/lib/perl5/vendor_perl/5.26.1/Graph/AdjacencyMatrix.pm /usr/lib/perl5/vendor_perl/5.26.1/Graph/Attribute.pm /usr/lib/perl5/vendor_perl/5.26.1/Graph/BitMatrix.pm /usr/lib/perl5/vendor_perl/5.26.1/Graph/Directed.pm /usr/lib/perl5/vendor_perl/5.26.1/Graph/MSTHeapElem.pm /usr/lib/perl5/vendor_perl/5.26.1/Graph/Matrix.pm /usr/lib/perl5/vendor_perl/5.26.1/Graph/SPTHeapElem.pm /usr/lib/perl5/vendor_perl/5.26.1/Graph/TransitiveClosure /usr/lib/perl5/vendor_perl/5.26.1/Graph/TransitiveClosure.pm /usr/lib/perl5/vendor_perl/5.26.1/Graph/TransitiveClosure/Matrix.pm /usr/lib/perl5/vendor_perl/5.26.1/Graph/Traversal /usr/lib/perl5/vendor_perl/5.26.1/Graph/Traversal.pm /usr/lib/perl5/vendor_perl/5.26.1/Graph/Traversal/BFS.pm /usr/lib/perl5/vendor_perl/5.26.1/Graph/Traversal/DFS.pm /usr/lib/perl5/vendor_perl/5.26.1/Graph/Undirected.pm /usr/lib/perl5/vendor_perl/5.26.1/Graph/UnionFind.pm /usr/lib/perl5/vendor_perl/5.26.1/Heap071 /usr/lib/perl5/vendor_perl/5.26.1/Heap071/Elem.pm /usr/lib/perl5/vendor_perl/5.26.1/Heap071/Fibonacci.pm /usr/lib/perl5/vendor_perl/5.26.1/auto/Heap071 /usr/lib/perl5/vendor_perl/5.26.1/auto/Heap071/Elem /usr/lib/perl5/vendor_perl/5.26.1/auto/Heap071/Elem/autosplit.ix /usr/lib/perl5/vendor_perl/5.26.1/auto/Heap071/Fibonacci /usr/lib/perl5/vendor_perl/5.26.1/auto/Heap071/Fibonacci/autosplit.ix /usr/lib/perl5/vendor_perl/5.26.1/x86_64-linux-thread-multi /usr/share/doc/packages/perl-Graph /usr/share/doc/packages/perl-Graph/Changes /usr/share/doc/packages/perl-Graph/DESIGN /usr/share/doc/packages/perl-Graph/README /usr/share/doc/packages/perl-Graph/RELEASE /usr/share/doc/packages/perl-Graph/TODO /usr/share/doc/packages/perl-Graph/util /usr/share/doc/packages/perl-Graph/util/cover.sh /usr/share/doc/packages/perl-Graph/util/grand.pl /usr/share/doc/packages/perl-Graph/util/renum.pl /usr/share/doc/packages/perl-Graph/util/size.pl /usr/share/doc/packages/perl-Graph/util/srand.pl /usr/share/man/man3/Graph.3pm.gz /usr/share/man/man3/Graph::AdjacencyMap.3pm.gz /usr/share/man/man3/Graph::AdjacencyMap::Vertex.3pm.gz /usr/share/man/man3/Graph::AdjacencyMatrix.3pm.gz /usr/share/man/man3/Graph::BitMatrix.3pm.gz /usr/share/man/man3/Graph::Directed.3pm.gz /usr/share/man/man3/Graph::Matrix.3pm.gz /usr/share/man/man3/Graph::TransitiveClosure.3pm.gz /usr/share/man/man3/Graph::TransitiveClosure::Matrix.3pm.gz /usr/share/man/man3/Graph::Traversal.3pm.gz /usr/share/man/man3/Graph::Traversal::BFS.3pm.gz /usr/share/man/man3/Graph::Traversal::DFS.3pm.gz /usr/share/man/man3/Graph::Undirected.3pm.gz /usr/share/man/man3/Graph::UnionFind.3pm.gz /usr/share/man/man3/Heap071::Elem.3pm.gz /usr/share/man/man3/Heap071::Fibonacci.3pm.gz
Generated by rpm2html 1.8.1
Fabrice Bellet, Tue Apr 9 14:50:04 2024