| Age | Commit message (Collapse) | Author | Files | Lines |
|---|
|
|
|
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!
|
|
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.
|
|
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.
|
|
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.
|
|
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.
|
|
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.
|
|
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=...").
|
|
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.
|
|
|
|
can handle packages having no PLIST files.
|
|
* 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).
|
|
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.
|
|
of Perl files to deal with the perl-5.8.7 update that moved all
pkgsrc-installed Perl files into the "vendor" directories.
|
|
These paths are now relative to PERL5_PACKLIST_DIR, which currently
defaults to ${PERL5_SITEARCH}. There is no change to the binary
packages.
|
|
|
|
|
|
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.
|
|
|
|
|
|
Should anybody feel like they could be the maintainer for any of thewe packages,
please adjust.
|
|
|
|
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.
|
