rgl 0.5.8 → 0.5.9

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 43739f63914a8070716c45a94f95c058b75efee0f4cd478a30d1cdc0e45e30c0
-  data.tar.gz: 44d66025f8ca816c618eb12ac4a7fee1fa315c4312af698909e87caa0bdb48ad
+  metadata.gz: 46f0ba3170d9e82f84439dcb11ef208feb2d5d593334a09df409552e1b5bfc9d
+  data.tar.gz: d4eb269e797b26c41e64dc92d27f5dd54a6ed42192ba66ca2a32274cdc4cdc6c
 SHA512:
-  metadata.gz: e910d7b6fdaaab9873f5daac67009eab91681789372e00e9d0bdbbfa09782f4b67763ce09634245cf0c07325847c5ec90695323dec65aaa6d940d775a89447a8
-  data.tar.gz: bfcd42c97cc6361e58145aa3bf5f97c89d3e9b9d1a290f67a4ffb52e0829f9f0aff06c4d17a4d0ed1f83997e0917a1fbd11cdf340a6967fc7e8cfa3ad6dc6118
+  metadata.gz: da77a826c9b614ab96717a5c982ca89e9c1d14e947277a10e2cd0c267871f16f2b50356b80afe8d8f8f0a954e5968fba167f9758c3b65b9370f64e4fed1bbc23
+  data.tar.gz: f950c03d0b707ac672fa0adb3a80ff7fd6ad8ddfd92e50abdffda4f36dd0e7d67ec73ca5eb815783d40f222336e2a8298cd79285b5d95f4447affc7333467e1a

data/ChangeLog

@@ -1,3 +1,8 @@
+2022-08 Release 0.5.9
+
+Dan Čermák
+ * Drop lazy priority queue (#64) (3b1db1)
+
 2022-06 Release 0.5.8
 
 Horst Duchene

data/README.md

@@ -3,20 +3,19 @@
 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++. Refer to http://www.boost.org/libs/graph/doc for
+which is written in C++. Refer to https://www.boost.org/libs/graph/doc for
 further links and documentation on graph data structures and algorithms and
 the design rationales of BGL.
 
 A comprehensive summary of graph terminology can be found in the graph section
 of the *Dictionary of Algorithms and Data Structures* at
-http://www.nist.gov/dads/HTML/graph.html or
+https://www.nist.gov/dads/HTML/graph.html or
 [Wikipedia](https://en.wikipedia.org/wiki/Graph_%28discrete_mathematics%29).
 
 ## Documentation
 
-*   RGL's [API Reference](http://www.rubydoc.info/github/monora/rgl) at
-    http://rubydoc.info
-
+*   RGL's [API Reference](https://www.rubydoc.info/github/monora/rgl) at
+    https://rubydoc.info
 
 ## Design principles
 
@@ -31,7 +30,6 @@ Ruby. The main design goals directly taken from the BGL design are:
 *   A standardized generic interface for traversing graphs
     {RGL::GraphIterator}
 
-
 RGL provides some general purpose graph classes that conform to this
 interface, but they are not meant to be the **only** graph classes. As in BGL
 I believe that the main contribution of the RGL is the formulation of this
@@ -48,11 +46,10 @@ achieve genericity:
 *   Element Type Parameterization
 *   Vertex and Edge Property Multi-Parameterization
 
-
 The first is easily achieved in RGL using mixins, which of course is not as
 efficient than C++ templates (but much more readable :-). The second one is
 even more easily implemented using standard iterators with blocks or using the
-[stream](http://www.rubydoc.info/github/monora/stream) module. The third one
+[stream](https://www.rubydoc.info/github/monora/stream) module. The third one
 is no issue since Ruby is dynamically typed: Each object can be a graph
 vertex. There is no need for a vertex (or even edge type). In the current
 version of RGL properties of vertices are simply attached using hashes. At
@@ -65,7 +62,6 @@ RGL current contains a core set of algorithm patterns:
 *   Breadth First Search {RGL::BFSIterator}
 *   Depth First Search {RGL::DFSIterator}
 
-
 The algorithm patterns by themselves do not compute any meaningful quantities
 over graphs, they are merely building blocks for constructing graph
 algorithms. The graph algorithms in RGL currently include:
@@ -77,7 +73,6 @@ algorithms. The graph algorithms in RGL currently include:
 *   Dijkstras Shortest Path Algorithm {RGL::DijkstraAlgorithm}
 *   Bellman Ford Algorithm {RGL::BellmanFordAlgorithm}
 
-
 ### Data Structures
 
 RGL currently provides two graph classes that implement a generalized
@@ -86,7 +81,6 @@ adjacency list and an edge list adaptor.
 *   {RGL::AdjacencyGraph}
 *   {RGL::ImplicitGraph}
 
-
 The AdjacencyGraph class is the general purpose _swiss army knife_ of graph
 classes. It is highly parameterized so that it can be optimized for different
 situations: the graph is directed or undirected, allow or disallow parallel
@@ -95,20 +89,20 @@ removal at the cost of extra space overhead, etc.
 
 ### Differences to BGL
 
-The concepts of IncidenceGraph, AdjacencyGraph and VertexListGraph (see
-http://www.boost.org/libs/graph/doc/IncidenceGraph.html) are here bundled in
-the base graph module. Most methods of IncidenceGraph should be standard in
-the base module Graph. The complexity guarantees can not necessarily provided.
- See http://www.boost.org/libs/graph/doc/graph_concepts.html.
+The concepts of IncidenceGraph, AdjacencyGraph and VertexListGraph
+(see [IncidenceGraph](https://www.boost.org/libs/graph/doc/IncidenceGraph.html)) are
+bundled in RGL's base graph module. Most methods of IncidenceGraph
+should be standard in the base module Graph. The complexity guarantees
+can not necessarily provided (see [BGL's Graph Concepts](https://www.boost.org/libs/graph/doc/graph_concepts.html)).
 
 ## Installation
 
     % gem install rgl
 
-or download the latest sources from the git repository
-http://github.com/monora/rgl.
+or download the latest sources from the [git
+repository](https://github.com/monora/rgl).
 
-If you are going to use the drawing functionalities install [Graphviz](http://www.graphviz.org/).
+If you are going to use the drawing functionalities install [Graphviz](https://www.graphviz.org/).
 
 ## Running tests
 
@@ -229,8 +223,6 @@ This graph shows all loaded RGL modules:
 Look for more in
 [examples](https://github.com/monora/rgl/tree/master/examples) directory.
 
-I collect some links to stuff around RGL at http://del.icio.us/monora/rgl.
-
 ## Credits
 
 Many thanks to Robert Feldt which also worked on a graph library
@@ -239,29 +231,28 @@ graph resources.
 
 Robert kindly allowed to integrate his work on graphr, which I did not yet
 succeed. Especially his work to output graphs for
-[GraphViz](http://www.graphviz.org) is much more elaborated than the minimal
+[GraphViz](https://www.graphviz.org) is much more elaborated than the minimal
 support in dot.rb.
 
 Jeremy Siek one of the authors of the nice book [The Boost Graph
-Library](http://www.boost.org/libs/graph/doc) kindly allowed to use the BGL
+Library](https://www.boost.org/libs/graph/doc) kindly allowed to use the BGL
 documentation as a *cheap* reference for RGL. He and Robert also gave feedback
 and many ideas for RGL.
 
-Dave Thomas for [RDoc](http://rdoc.sourceforge.net) which generated what you
+Dave Thomas for [RDoc](https://rdoc.sourceforge.net) which generated what you
 read and matz for Ruby. Dave included in the latest version of RDoc (alpha9)
 the module dot/dot.rb which I use instead of Roberts module to visualize
 graphs (see rgl/dot.rb).
 
-Jeremy Bopp, John Carter, Sascha Doerdelmann, Shawn Garbett, Andreas Schörk
-and Kirill Lashuk for contributing additions, test cases and bugfixes.
-
-Kirill Lashuk who started to take over further development in November 2012.
+Jeremy Bopp, John Carter, Sascha Doerdelmann, Shawn Garbett, Andreas
+Schörk, Dan Čermák and Kirill Lashuk for contributing additions, test
+cases and bugfixes.
 
-See also http://github.com/monora/rgl/contributors.
+See also: https://github.com/monora/rgl/contributors
 
 ## Copying
 
-RGL is Copyright (c) 2002,2004,2005,2008,2013,2015,2019,2020 by Horst
+RGL is Copyright (c) 2002,2004,2005,2008,2013,2015,2019,2020,2022 by Horst
 Duchene. It is free software, and may be redistributed under the [Ruby
 license](https://en.wikipedia.org/wiki/Ruby_License) and terms specified in
 the LICENSE file.

data/lib/rgl/base.rb

@@ -4,7 +4,7 @@
 # library. The main module is RGL::Graph which defines the abstract behavior of
 # all graphs in the library.
 
-RGL_VERSION = "0.5.8"
+RGL_VERSION = "0.5.9"
 
 module RGL
   class NotDirectedError < RuntimeError; end

data/lib/rgl/bellman_ford.rb

@@ -2,8 +2,6 @@ require 'rgl/dijkstra_visitor'
 require 'rgl/edge_properties_map'
 require 'rgl/path_builder'
 
-require 'lazy_priority_queue'
-
 module RGL
 
   # Bellman-Ford shortest paths algorithm has the following event points:

data/lib/rgl/dijkstra.rb

@@ -2,7 +2,7 @@ require 'rgl/dijkstra_visitor'
 require 'rgl/edge_properties_map'
 require 'rgl/path_builder'
 
-require 'lazy_priority_queue'
+require 'pairing_heap'
 
 module RGL
 
@@ -54,7 +54,7 @@ module RGL
     def init(source)
       @visitor.set_source(source)
 
-      @queue = MinPriorityQueue.new
+      @queue = PairingHeap::MinPriorityQueue.new
       @queue.push(source, 0)
     end
 

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: rgl
 version: !ruby/object:Gem::Version
-  version: 0.5.8
+  version: 0.5.9
 platform: ruby
 authors:
 - Horst Duchene
@@ -9,7 +9,7 @@ authors:
 autorequire: rgl/base
 bindir: bin
 cert_chain: []
-date: 2022-06-02 00:00:00.000000000 Z
+date: 2022-08-29 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: stream
@@ -26,19 +26,19 @@ dependencies:
       - !ruby/object:Gem::Version
         version: 0.5.3
 - !ruby/object:Gem::Dependency
-  name: lazy_priority_queue
+  name: pairing_heap
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
-        version: 0.1.0
+        version: 0.3.0
   type: :runtime
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
-        version: 0.1.0
+        version: 0.3.0
 - !ruby/object:Gem::Dependency
   name: rexml
   requirement: !ruby/object:Gem::Requirement