CVS log for pkgsrc/devel/p5-Graph/Makefile

Up to [cvs.NetBSD.org] / pkgsrc / devel / p5-Graph

Request diff between arbitrary revisions

Keyword substitution: kv
Default branch: MAIN

*: recursive bump for perl 5.40

Update to 0.9732

Upstream changes:
0.9732 2024-09-02
- delete_vertex_by_id now deletes edges if vertex multiness to 0
- add filter_{vertic,edg}es
- {un,}directed_copy no longer use caching mechanism so can mutate copies

0.9731 2024-08-24
- add add_{edges,path}_by_id
- fix calling "new" on Graph::Undirected object
- make {,{un,}directed_}copy preserve multi{edg,vertex}ed
- add {un,}directed_copy_attributes

0.9730 2024-08-22
- add get_edge_attribute_all
- make SP_Dijkstra and SP_Bellman_Ford work with multiedged

0.9729 2024-06-28
- add is_planar (#31) - thanks @merkys

0.9728 2024-06-25
- add is_bipartite (#30) - thanks @merkys

(devel/p5-Graph) Updated 0.9725 to 0.9727

0.9727 2023-06-25
- fix biconnectivity to work with refvertexed (#29) - thanks @merkys for report

0.9726 2023-02-11
- fix subgraph of undirected (#28) - thanks @merkys for report

*: recursive bump for perl 5.38

*: recursive bump for perl 5.36

Update to 0.9725

Upstream changes:
 Changes for version 0.9725 - 2021-10-10

    fix refvertexed which was stringifying not using ref address - thanks @merkys for report

Update to 0.9724

Upstream changes:
0.9724 2021-09-13
- make deep_copy not interfere with $. - thanks @merkys for report

0.9723 2021-09-01
- doc fixes - thanks @xsawyerx
- fix problem with deep_copy with vertices that are refs - thanks @merkys for report

0.9722 2021-07-04
- fix neighbours et al not returning count in scalar context - thanks @merkys for report

*: recursive bump for perl 5.34

Update to 0.9721
Add missing DEPENDS

Upstream changes:
0.9721 2021-04-18
- fix BitMatrix and AdjacencyMatrix problems - thanks @dod38fr for report

0.9720 2021-03-25
- better fix - no mutate inputs

0.9719 2021-03-25
- fix all_paths infinite loop on cycle - thanks @tobez for report

0.9718 2021-03-13
- remove doc of deleted average_degree method - thanks @lindleyw for report

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

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.

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

0.9711 2020-11-27
- ingest handle multivertexed, multiedged right

0.9710 2020-11-27
- all_paths method
- as_hashes handle multivertexed, multiedged right

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

0.9708 2020-11-06
- update metadata for Test::More version dep
- stringify hypervertices right
- add rename_vertex, rename_vertices

0.9707 2020-10-31
- can't use Safe, ergo Storable, on 5.8

0.9706 2020-10-20
- metadata list test-deps as not runtime

0.9705 2020-10-20
- document clustering_coefficient return empty list on no vertices - RT#114094
- apply lazy-load patch from Stephen Loyd - RT#123236
- depend on Heap 0.80 instead of local fork. Heap::Elem is really an interface not superclass.
- fix uninitialised value warning in SP_Dijkstra - RT#118539
- fix complement losing vertices on unconnected graphs - RT#115366
- fix average_path_length when two vertices given - RT#120611
- switch to GitHub issues rather than RT
- fix all_successors with non-truthy names - fix #5
- add Graph::Matrix->stringify to help debug
- fix APSP_Floyd_Warshall logic error when subpaths totalled 0 - fix #3
- typo fix - thanks @jkeenan (#6)
- Added "use strict; use warnings;", etc - thanks @manwar (closes #2)

*: bump PKGREVISION for perl-5.32.

Bump PKGREVISIONs for perl 5.30.0

Update packages using a search.cpan.org HOMEPAGE to metacpan.org.

The former now redirects to the latter.

This covers the most simple cases where http://search.cpan.org/dist/name
can be changed to https://metacpan.org/release/name.

Reviewed by hand to hopefully make sure no unwanted changes sneak in.

Recursive bump for perl5-5.28.0

Recursive revbump from lang/perl5 5.26.0

Bump PKGREVISION for perl-5.24.

Updated to devel/p5-Graph-0.9704
--------------------------------
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

Update to 0.9703

Upstream 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()

0.97 2015-09-22  Jarkko Hietaniemi  <jhi@iki.fi>
    - rt.cpan.org 104687 diameter and centre of a one vertex graph
    - rt.cpan.org 107195 [PATCH] fix POD: add missing NAME header
    - rt.cpan.org 107194 [PATCH] fix a spelling mistake
    - rt.cpan.org #94046 Loading graph produces a warning with Perl 5.16.3
    - rt.cpan.org 62626 Graph::TransitiveClosure::Matrix contradictory wrt reflexive
    - rt.cpan.org 71793 Problem with APSP and default weight 1
    - rt.cpan.org 79143 Graph scalar context override causes problems
    - rt.cpan.org 92427 Graph::delete_vertex should not use _edges_at (in all cases)
    - rt.cpan.org 85238 bug in edges() method?
    - rt.cpan.org 93278 SPT_Dijkstra sometimes returns a wrong answer
    - rt.cpan.org 78465 find_a_cycle and has_cycle are broken
    - rt.cpan.org 92204 (longest path is not calculated correctly in this case)
    - rt.cpan.org 65497 induced subgraph method
    - plus various doc and code nits found while looking at the above

0.96_01 2014-03-09 @NEILB
    - Taken over maintenance from JHI
    - Specified min perl version 5.6.0
    - Tweaked COPYRIGHT and LICENSE in pod to match usual form
    - Added "use warnings", but that results in loads of warnings
      about functions redefined. So added "no warnings 'redefine';".
      Have to come back and work that one out!
    - Set all VERSION's to 0.96_01. I suspect a switch to Dist::Zilla
      might be coming soon...
    - Updated README to acknowledge change in maintainer
    - Reformatted as per CPAN::Changes::Spec

Recursive PKGREVISION bump for all packages mentioning 'perl',
having a PKGNAME of p5-*, or depending such a package,
for perl-5.22.0.

Remove pkgviews: don't set PKG_INSTALLATION_TYPES in Makefiles.

Bump for perl-5.20.0.
Do it for all packages that
* mention perl, or
* have a directory name starting with p5-*, or
* depend on a package starting with p5-
like last time, for 5.18, where this didn't lead to complaints.
Let me know if you have any this time.

Bump all packages for perl-5.18, that
a) refer 'perl' in their Makefile, or
b) have a directory name of p5-*, or
c) have any dependency on any p5-* package

Like last time, where this caused no complaints.

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.

Drop superfluous PKG_DESTDIR_SUPPORT, "user-destdir" is default these days.

Bump all packages that use perl, or depend on a p5-* package, or
are called p5-*.

I hope that's all of them.

Revision bump after updating perl5 to 5.14.1.

Bump the PKGREVISION for all packages which depend directly on perl,
to trigger/signal a rebuild for the transition 5.10.1 -> 5.12.1.

The list of packages is computed by finding all packages which end
up having either of PERL5_USE_PACKLIST, BUILDLINK_API_DEPENDS.perl,
or PERL5_PACKLIST defined in their make setup (tested via
"make show-vars VARNAMES=..."), minus the packages updated after
the perl package update.

sno@ was right after all, obache@ kindly asked and he@ led the
way. Thanks!

Updating devel/p5-Graph from 0.93 to 0.94

Upstream changes:
2010-03-13 - Release 0.94 - Jarkko Hietaniemi  <jhi@iki.fi>
	* Address rt.cpan.org #43580:
	  "Reversed logic on overload::StrVal() in AdjacencyMap::Vertex::__set_path"
	  Had to add a new option, refvertexed_stringified.
	* Address rt.cpan.org #50210:
	  "Graph-0.91: bug in unionfind parameter"
	  One cannot delete from a unionfind graph: now enforcing that.
	* Address rt.cpan.org #48090:
	  "all_reachable on directed $g->add_edges(['a','b'],['b','a'])"
	  Now if there are loops, all_reachable() will include
	  the initial vertices themselves.  Also all_neighbors()
	  had some problems in certain cases, fixed those too.
	* Address rt.cpan.org #50210:
	  "Graph-0.91: bug in unionfind parameter"
	  One cannot delete edges or vertices from a unionfind
	  graph: now enforce that in code.
	* Address rt.pcan.org #42549: "stron"
	  Document that strongly connected components will include
	  isolated and sink and source vertices.

Updating devel/p5-Graph from 0.91 to 0.93

pkgsrc changes:
- Add license definition

Upstream changes:
2010-03-07  Jarkko Hietaniemi  <jhi@iki.fi>
	* Revert the SPTHeapElem.pm change made in Graph 0.92,
	  installing Heap 0.80 broke Graph.  Better be conservative.

2010-03-03  Jarkko Hietaniemi  <jhi@iki.fi>
	* Address rt.cpan.org #55912 "Broken links in the documentation"
	* Address rt.cpan.org #55196 "Heap 0.80 compatibility fix"
	* Add copyright and clearer license statement.
	* Release as 0.92.

Update from version 0.90 to 0.91.

Upstream changes:

2009-01-16  Jarkko Hietaniemi  <jhi@iki.fi>
	* Minor documentation cleanups.
	* Add 'use strict;' to lib/Graph/TransitiveClosure.pm.
	* Modernize the META.yml.
	* Release as 0.91.

Update from version 0.86 to 0.90.

Upstream changes:

2008-12-29  Jarkko Hietaniemi  <jhi@iki.fi>

	* Storable deparse of coderefs for deep_copy() does not
	  work at all with 5.6.2: if modern enough Storable
	  and B::Deparse are not available, fall back to
	  the previous version which used Data::Dumper.

	* Release as 0.90.

2008-12-27  Jarkko Hietaniemi  <jhi@iki.fi>

	* Some PAUSE upload problem with 0.88, retrying.

	* Release as 0.89.

2008-12-26  Jarkko Hietaniemi  <jhi@iki.fi>

	* The 0.87 forgot to specify the Storable (and Safe,
	  used in the deserialization step of deep_copy)
	  prerequirement(s) in Makefile.PL.

	* Release as 0.88.

2008-12-26  Jarkko Hietaniemi  <jhi@iki.fi>

	* Addressed a performance problem in successors()
	  and predecessors(), reported by Jonathan Moore.

	* Reimplement deep_copy() by using Storable
	  freeze() and thaw() instead of Data::Dumper,
	  inspired by Jonathan Moore.  Probably now safer
	  and faster, but Storable is now a prerequirement.

	* Release as 0.87.

Update from version 0.84nb1 to 0.86.

Pkgsrc changes:
 o Add HOMEPAGE using search.cpana.org
 o Remove apparently not-needed dependency on p5-Heap

Upstream changes:

2008-11-27  Jarkko Hietaniemi  <jhi@iki.fi>

	* Addressed a performance problem in connected_components()
	  for 1000+ vertex graphs, reported by David Grobe.
	  Should in general speed up graph traversal.

	* Release as 0.86.

2008-11-27  Jarkko Hietaniemi  <jhi@iki.fi>

	* Address rt.cpan.org #31608 "Graph::Undirected, unionfind and
	  connected_component"

	* Address rt.cpan.org #34377 "recursive successors and predecessors"
	  (added all_successors/all_predecessors/all_neighbours/all_reachable)

	* Address rt.cpan.org #39444 "inconsistent return value"
	  (make add_edges and add_vertices to always return the graph)

	* Address rt.cpan.org #39614 "copy should retain more attributes"
	  (now copies also refvertexed/hypervertexed/countvertexed/
	   multivertexed/hyperedged/countedged/multiedged/omniedged)

	* Address rt.cpan.org #39805 "UnionFind: Repeated adds clobbers
	  graph component information"

	* Address rt.cpan.org #41190 "add_edge_by_id on multigraph
	  malfunctioning"

	* Added betweenness(), clustering_coefficient(), and
	  subgraph_by_radius(), contributed by Matt Spear.

	* Release as 0.85.

Bump the PKGREVISION for all packages which depend directly on perl,
to trigger/signal a rebuild for the transition 5.8.8 -> 5.10.0.

The list of packages is computed by finding all packages which end
up having either of PERL5_USE_PACKLIST, BUILDLINK_API_DEPENDS.perl,
or PERL5_PACKLIST defined in their make setup (tested via
"make show-vars VARNAMES=...").

updated to 0.84
ChangeLog:
2007-08-13  Jarkko Hietaniemi  <jhi@iki.fi>

	* Tels found one more attributed edge problem.

	* Release as 0.84.

2007-08-12  Jarkko Hietaniemi  <jhi@iki.fi>

	* One test in 73_diameter.t had too many possible answers,
	  dependent on the hash ordering, removed the test.

	* Release as 0.83.

2007-08-11  Jarkko Hietaniemi  <jhi@iki.fi>

	* Since Heap 0.80 broke Graph, as a stop-gap measure
	  I will include the Heap::Elem and Heap::Fibonacci
	  of Heap 0.71, renamed as 'Heap071', addresses rt.cpan.org
	  #26943: "Heap 0.80 breaks Graph", and numerous bug reports
	  by email

	* Address rt.cpan.org #27840: "add-edge_attributes() on
	  undirected graph wrongly depends on node order", from Tels

	* Address rt.cpan.org #27959: "radius method incorrect",
	  code and test case from ROSULEK.

	* Release as 0.82.

2007-01-21  Jarkko Hietaniemi  <jhi@iki.fi>

	* Address rt.cpan.org #24417: "next_successor unavailable in
	  Traversal (PATCH)", from Ted Carnahan.

	* Small pod tweaks.

	* Minor internal cleanup for the caching code.

	* Release as 0.81.

Add DESTDIR support.

Update to 0.80. Main changes since 0.20:
        * THIS IS NOT COMPATIBLE with the old 0.2xxx series of the Graph
        module. Your scripts are likely to break.  I did try to fashion a
        nice compatibility mode but there was no way to do that cleanly
        and to cover all the old oddities.  You can try the compatibility
        mode but I suggest changing your code instead because the compat
        mode is not going to be carried over to the next releases of the
        module.
        * The main reason for introducing the incompatibilities was that
        the new Graph supports graphs of 'higher dimensions', and the
        assumptions made by the old module (most importantly that edges
        could only span two vertices) in effect made it impossible to
        extend the interfaces.
        * The next version of Graph (most likely 0.90) is going to aim
        for speed.  The backward compatibility for the 0.2xxx series
        will be dropped (because that, too, slows down this release).

Point MAINTAINER to pkgsrc-users@NetBSD.org in the case where no
developer is officially maintaining the package.

The rationale for changing this from "tech-pkg" to "pkgsrc-users" is
that it implies that any user can try to maintain the package (by
submitting patches to the mailing list).  Since the folks most likely
to care about the package are the folks that want to use it or are
already using it, this would leverage the energy of users who aren't
developers.

Bump the PKGREVISIONs of all (638) packages that hardcode the locations
of Perl files to deal with the perl-5.8.7 update that moved all
pkgsrc-installed Perl files into the "vendor" directories.

Turn PERL5_PACKLIST into a relative path instead of an absolute path.
These paths are now relative to PERL5_PACKLIST_DIR, which currently
defaults to ${PERL5_SITEARCH}.  There is no change to the binary
packages.

Remove USE_BUILDLINK3 and NO_BUILDLINK; these are no longer used.

since perl is now built with threads on most platforms, the perl archlib
module directory has changed (eg. "darwin-2level" vs.
"darwin-thread-multi-2level").

binary packages of perl modules need to be distinguishable between
being built against threaded perl and unthreaded perl, so bump the
PKGREVISION of all perl module packages and introduce
BUILDLINK_RECOMMENDED for perl as perl>=5.8.5nb5 so the correct
dependencies are registered and the binary packages are distinct.

addresses PR pkg/28619 from H. Todd Fujinaka.

Bl3ify and enable pkgviews installation.

s/netbsd.org/NetBSD.org/

Use tech-pkg@ in favor of packages@ as MAINTAINER for orphaned packages.
Should anybody feel like they could be the maintainer for any of thewe packages,
please adjust.

Use perl5/module.mk.

Initial import of p5-Graph version 0.201 into the Packages Collection. 

This is a perl module for graph operations as the code was for the 1st edition
of "Mastering Algorithms with Perl", by Jon Orwant, Jarkko Hietaniemi, and John
Macdonald, published in August 1999 by the O'Reilly and Associates.

Initial revision