kpriv/pkgsrc
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity
pkgsrc/devel/ruby-rgl/Makefile

18 lines
502 B
Makefile
Raw Normal View History

devel/ruby-rgl: update to 0.5.6 update ruby-rgl to 0.5.6. pkgsrc change: add "USE_LANGUAGES= # none". 2019-01 Release 0.5.6 Artemy Kirienko * PR #42 Add method Graph#path?(u, v) to check if a path exists between two vertices Horst Duchene * Fix #47 set_to_begin for graph iterator (881aa8) 2019-01 Release 0.5.5 Artemy Kirienko * PR #42 Add method Graph#path?(u, v) to check if a path exists between two vertices Horst Duchene * Fix #47 set_to_begin for graph iterator (881aa8)
2019-10-30 16:27:41 +01:00
# $NetBSD: Makefile,v 1.12 2019/10/30 15:27:41 taca Exp $
Import ruby-rgl. RGL is a framework for graph data structures and algorithms. The design of the library is much influenced by the Boost Graph Library (BGL) which is written in C++ heavily using its template mechanism. RGL provides some general purpose graph classes that conform to the interface for how the structure of a graph can be accessed using a generic interface that hides the details of the graph data structure implementation, but they are not meant to be the only graph classes. As in BGL, the main contribution of the RGL is the formulation of this interface.
2006-05-04 01:11:03 +02:00
devel/ruby-rgl: update to 0.5.6 update ruby-rgl to 0.5.6. pkgsrc change: add "USE_LANGUAGES= # none". 2019-01 Release 0.5.6 Artemy Kirienko * PR #42 Add method Graph#path?(u, v) to check if a path exists between two vertices Horst Duchene * Fix #47 set_to_begin for graph iterator (881aa8) 2019-01 Release 0.5.5 Artemy Kirienko * PR #42 Add method Graph#path?(u, v) to check if a path exists between two vertices Horst Duchene * Fix #47 set_to_begin for graph iterator (881aa8)
2019-10-30 16:27:41 +01:00
DISTNAME= rgl-0.5.6
Import ruby-rgl. RGL is a framework for graph data structures and algorithms. The design of the library is much influenced by the Boost Graph Library (BGL) which is written in C++ heavily using its template mechanism. RGL provides some general purpose graph classes that conform to the interface for how the structure of a graph can be accessed using a generic interface that hides the details of the graph data structure implementation, but they are not meant to be the only graph classes. As in BGL, the main contribution of the RGL is the formulation of this interface.
2006-05-04 01:11:03 +02:00
CATEGORIES= devel
MAINTAINER= minskim@NetBSD.org
Update HOMEPAGE. Avoid using rubyforge.org since it stopped most of services.
2015-09-26 17:02:18 +02:00
HOMEPAGE= https://github.com/monora/rgl
Import ruby-rgl. RGL is a framework for graph data structures and algorithms. The design of the library is much influenced by the Boost Graph Library (BGL) which is written in C++ heavily using its template mechanism. RGL provides some general purpose graph classes that conform to the interface for how the structure of a graph can be accessed using a generic interface that hides the details of the graph data structure implementation, but they are not meant to be the only graph classes. As in BGL, the main contribution of the RGL is the formulation of this interface.
2006-05-04 01:11:03 +02:00
COMMENT= Framework for graph data structures and algorithms
Update ruby-rgl to 0.5.3. 2016-05 Release 0.5.3 Horst Duchene * Issue #38: Add error handling or dot functions. (719e38, 5a3423) Thomas Orozco * Remove Enumerable Extension (fde8a5) * Update to codeclimate-test-reporter 1.x (25fdb5) Mario Daskalov * Clarify that you need graphviz in the README (35a4b4)
2017-06-04 18:13:07 +02:00
LICENSE= ruby-license
Import ruby-rgl. RGL is a framework for graph data structures and algorithms. The design of the library is much influenced by the Boost Graph Library (BGL) which is written in C++ heavily using its template mechanism. RGL provides some general purpose graph classes that conform to the interface for how the structure of a graph can be accessed using a generic interface that hides the details of the graph data structure implementation, but they are not meant to be the only graph classes. As in BGL, the main contribution of the RGL is the formulation of this interface.
2006-05-04 01:11:03 +02:00
devel/ruby-rgl: update to 0.5.4 2019-01 Release 0.5.4 Lia Skalkos * Enable options to be passed to #write_to_graphic_file (4ca972). For details see PR #41 Horst Duchene * Fix travis-ci errors * Add new ruby versions * Fix gemspec errors * Fix lint warnings * Use version stream 0.5.2
2019-02-25 17:43:23 +01:00
DEPENDS+= ${RUBY_PKGPREFIX}-stream>=0.5.2:../../devel/ruby-stream
Update to ruby-rgl to 0.5.2. 2016-05 Release 0.5.2 Horst Duchene <monora@gmail.com> * Issue #21: Use new method vertex_id instead of object_id to identify vertices in dot export. (fa7592) * Integrate Code Climate's test coverage reporting (0ab722) * Clarify traversal order of DFS search (see #20). (afa788) Chase Gilliam <chase.gilliam@gmail.com> * drop 1.9.3 add newer jruby and rubinius (fad333) Mat«¿as Battocchia <matias@riseup.net> * Switched to a different heap implementation. (bd7c13) gorn <j@kub.cz> * Adding failing test for issue #24 (1f6204)
2016-10-09 17:00:04 +02:00
DEPENDS+= ${RUBY_PKGPREFIX}-lazy_priority_queue>0.1.0<0.2:../../devel/ruby-lazy_priority_queue
Update ruby-rgl to 0.5.0. 2014-12 Release 0.5.0 This release mainly contains the contributions of Kirill, who added many algorithms to the library. Thank you Kirill! * @matiaskorhonen: Fixes the image paths in the README (#14) * @monora: Implicit graph example fails (#13) * @KL-7: Implement Graph#bipartite_sets. (#12) * @monora: syntax error in dot file for undirected graph (#11) * @KL-7: Edmonds-Karp algorithm for maximum flow (#10) * @KL-7: Prim's algorithm for minimum spanning tree (#9) * @carlosantoniodasilva: Run tests on Ruby 2.0 and remove deprecation warning (#8) * @KL-7: Bellman-Ford shortest paths algorithm (#7) * @KL-7: Minor improvements (asserts) for Dijkstra algorithm (#6) * @KL-7: Add Dijkstra shortest path algorithm. (#5) * @KL-7: Indentation and whitespaces clean up of examples (#4) * @KL-7: Travis configuration and README updates (#3) * @KL-7: Code clean up and configuration updates (#2) * @aschoerk: Renamed test-directory, (includes Rakefile), fixed TestComponents (#1)
2015-02-02 14:00:07 +01:00
devel/ruby-rgl: update to 0.5.6 update ruby-rgl to 0.5.6. pkgsrc change: add "USE_LANGUAGES= # none". 2019-01 Release 0.5.6 Artemy Kirienko * PR #42 Add method Graph#path?(u, v) to check if a path exists between two vertices Horst Duchene * Fix #47 set_to_begin for graph iterator (881aa8) 2019-01 Release 0.5.5 Artemy Kirienko * PR #42 Add method Graph#path?(u, v) to check if a path exists between two vertices Horst Duchene * Fix #47 set_to_begin for graph iterator (881aa8)
2019-10-30 16:27:41 +01:00
USE_LANGUAGES= # none
Update devel/ruby-rgl pacakge to 0.4.0. * Use lang/ruby/gem.mk instead of misc/rubygems/rubygem.mk. 2008-08-28 01:36 javanthropus * ChangeLog (tags: REL_0_4_0): pre-tag commit 2008-08-28 01:36 javanthropus * Rakefile (tags: REL_0_4_0): Update rdoc2rf task to use rsync and more generic remote path specification 2008-08-27 23:30 javanthropus * lib/rgl/base.rb (tags: REL_0_4_0): Preparing for 0.4.0 release 2008-08-26 20:07 javanthropus * lib/rgl/dot.rb, lib/rgl/rdot.rb, tests/TestRdot.rb: Move the DOT module into the RGL module * This eliminates a class conflict with the DOT module from rdoc when building RGL's documentation * Also remove the superfluous DOT prefixes from class names in the DOT module 2008-08-24 06:16 javanthropus * Rakefile: Remove some comments I accidentally left in while testing rdoc functionality 2008-08-24 06:03 javanthropus * Rakefile, lib/rgl/transitiv_closure.rb, lib/rgl/transitivity.rb, tests/TestTransitiveClosure.rb, tests/TestTransitivity.rb: Feature 21641: Added transitive reduction functionality * Updated the gem description to announce this functionality * Moved the transitive closure functionality into the transitivity.rb file along with the transitive reduction funtionality * Modifed the transitiv_closure.rb file to simply load the transitivity.rb file for backward compatibility * Moved all transitivity tests into TestTransitivity.rb 2008-08-23 15:45 javanthropus * lib/rgl/condensation.rb, lib/rgl/transitiv_closure.rb, tests/TestTransitiveClosure.rb: Defect 21630: Fixed transitive closure * The fix is based on the algorithm described in the documentation for the implementation of transitive closure in Boost * Along with the fix, performance is improved to O(|V||E|) * This implementation needs graph condensation, so that function was added as well * More tests were added to cover more corner cases 2008-08-23 05:40 javanthropus * tests/TestGraph.rb: Update basic graph tests to account for graphs with edgeless vertices Also clean up some minor formatting and assertion issues 2008-08-23 05:37 javanthropus * lib/rgl/adjacency.rb: Defect 21609: Fix the to_adjacency method to preserve edgeless vertices 2008-03-18 15:03 javanthropus * lib/rgl/rdot.rb, tests/TestRdot.rb: More reliably detect and handle newlines embedded within IDs and labels
2010-09-10 08:21:16 +02:00
.include "../../lang/ruby/gem.mk"
Import ruby-rgl. RGL is a framework for graph data structures and algorithms. The design of the library is much influenced by the Boost Graph Library (BGL) which is written in C++ heavily using its template mechanism. RGL provides some general purpose graph classes that conform to the interface for how the structure of a graph can be accessed using a generic interface that hides the details of the graph data structure implementation, but they are not meant to be the only graph classes. As in BGL, the main contribution of the RGL is the formulation of this interface.
2006-05-04 01:11:03 +02:00
.include "../../mk/bsd.pkg.mk"
Reference in a new issue Copy permalink