SEARCH
NEW RPMS
DIRECTORIES
ABOUT
FAQ
VARIOUS
BLOG

 
 
Changelog for perl-Graph-0.9725-bp155.1.4.noarch.rpm :

* Mon Oct 11 2021 Tina Müller - updated to 0.9725 see /usr/share/doc/packages/perl-Graph/Changes 0.9725 2021-10-10 - fix refvertexed which was stringifying not using ref address - thanks AATTmerkys for report
* Tue Sep 14 2021 Tina Müller - updated to 0.9724 see /usr/share/doc/packages/perl-Graph/Changes 0.9724 2021-09-13 - make deep_copy not interfere with $. - thanks AATTmerkys for report
* Thu Sep 02 2021 Tina Müller - updated to 0.9723 see /usr/share/doc/packages/perl-Graph/Changes 0.9723 2021-09-01 - doc fixes - thanks AATTxsawyerx - fix problem with deep_copy with vertices that are refs - thanks AATTmerkys for report
* Mon Jul 05 2021 Tina Müller - updated to 0.9722 see /usr/share/doc/packages/perl-Graph/Changes 0.9722 2021-07-04 - fix neighbours et al not returning count in scalar context - thanks AATTmerkys for report
* Mon Apr 19 2021 Tina Müller - updated to 0.9721 see /usr/share/doc/packages/perl-Graph/Changes 0.9721 2021-04-18 - fix BitMatrix and AdjacencyMatrix problems - thanks AATTdod38fr for report
* Fri Mar 26 2021 Tina Müller - updated to 0.9720 see /usr/share/doc/packages/perl-Graph/Changes 0.9720 2021-03-25 - better fix - no mutate inputs 0.9719 2021-03-25 - fix all_paths infinite loop on cycle - thanks AATTtobez for report
* Sun Mar 14 2021 Tina Müller - updated to 0.9718 see /usr/share/doc/packages/perl-Graph/Changes 0.9718 2021-03-13 - remove doc of deleted average_degree method - thanks AATTlindleyw for report
* Thu Jan 28 2021 Tina Müller - updated to 0.9717 see /usr/share/doc/packages/perl-Graph/Changes 0.9717 2021-01-27 - bulk APIs for UnionFind - add unionfind config option for util/grand.pl (benchmark-ish script) - GRAPH_ALLOW_RECURSION env var to turn off recursion protection - \"Light\" edge-map now uses bit-vectors -> smaller storage - directed hypergraphs - fix same_biconnected_components logic when given >2 vertices
* Sat Jan 02 2021 Tina Müller - updated to 0.9716 see /usr/share/doc/packages/perl-Graph/Changes 0.9716 2021-01-01 - use Set::Object - {neighbours,successors,predecessors,reachable}_by_radius 0.9715 2020-12-31 - fix AdjacencyMap::Light attributes so delete when path deleted - fix as_hashes undirected edges: now both directions - subgraph_by_radius take multiple vertices 0.9714 2020-12-25 - remove \"omni
*\" - hypergraphs are simply directed or undirected - as_hashes works with undirected hypergraphs - add_edge with != 2 vertices only for undirected hypergraph - any_edge - delete_
*_attributes_by_id (and deleting last attribute) now don\'t destroy that entity - AdjacencyMap::Light can have attributes, so no slowdown if use (eg APSP) 0.9713 2020-12-19 - fix edges_at on self-edges in scalar context - fix refvertexed_stringified predicate - remove \"hypervertices\": a collection of n vertices is a hyperedge - AdjacencyMap.get_paths_by_ids - transitive_closure et al no longer re-bless objects to Graph - AdjacencyMap.get_ids_by_paths - no more uniqedged configurability - BitMatrix transpose option - Transitive closure records path successor, not predecessor. Method name and docs updated.
* Sun Dec 06 2020 Tina Müller - updated to 0.9712 see /usr/share/doc/packages/perl-Graph/Changes 0.9712 2020-12-05 - bug-fix: set_edge_attribute_by_id add_edge_by_id if not exist - connected_component_by_index behaves same with/without unionfind - AdjacencyMatrix handle multiedged - reduce redundant sorting for _UNORD, fix AdjacencyMap::Vertex with ID 0 - AdjacencyMap.stringify - allow constructor args to override \"prototype\" object - fix docs for TransitiveClosure to correctly say path_vertices default true - AdjacencyMatrix now always creates adjacency matrix (clue in name) - remove compat02 features - drop untested scalar-context Traversal.postorder mutation behaviour - much more lazy-loading of modules - set_vertex_attribute_by_id now works on hypervertexed - internal AdjacencyMap uses array not hash for mapping index to path - successors/predecessors/rename_path work right with multivertex - AdjacencyMap array -> stable vertices ordering, TCM performance benefit - TransitiveClosure etc handle multiedged - all_paths ignore self-loops
* Sat Nov 28 2020 Tina Müller - updated to 0.9711 see /usr/share/doc/packages/perl-Graph/Changes 0.9711 2020-11-27 - ingest handle multivertexed, multiedged right 0.9710 2020-11-27 - all_paths method - as_hashes handle multivertexed, multiedged right
* Mon Nov 23 2020 Tina Müller - updated to 0.9709 see /usr/share/doc/packages/perl-Graph/Changes 0.9709 2020-11-22 - add path_count option to TransitiveClosure - get_{edge,vertex}_attributes undef if no such entity, in list context - as_hashes method - ingest method
* Sat Nov 07 2020 Tina Müller - updated to 0.9708 see /usr/share/doc/packages/perl-Graph/Changes 0.9708 2020-11-06 - update metadata for Test::More version dep - stringify hypervertices right - add rename_vertex, rename_vertices
* Sun Nov 01 2020 Tina Müller - updated to 0.9707 see /usr/share/doc/packages/perl-Graph/Changes 0.9707 2020-10-31 - can\'t use Safe, ergo Storable, on 5.8
* Wed Oct 21 2020 Tina Müller - updated to 0.9706 see /usr/share/doc/packages/perl-Graph/Changes
* Sat Oct 10 2015 cooloAATTsuse.com- updated to 0.9704 see /usr/share/doc/packages/perl-Graph/Changes 0.9704 2015-10-07 Jarkko Hietaniemi - 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 cooloAATTsuse.com- updated to 0.9703 see /usr/share/doc/packages/perl-Graph/Changes 0.9703 2015-09-29 Jarkko Hietaniemi - 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 - 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 cooloAATTsuse.com- updated to 0.97 see /usr/share/doc/packages/perl-Graph/Changes
 
ICM