rgl 0.5.6 → 0.5.9

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 6cc432ed6e3560ca66d241be508defa12cd832a205df40f6f06e50ae187cb35f
-  data.tar.gz: 4f31192830a5a78b1d42c1a150a0f5b649750abb440ea06df689fa3dfc4c9621
+  metadata.gz: 46f0ba3170d9e82f84439dcb11ef208feb2d5d593334a09df409552e1b5bfc9d
+  data.tar.gz: d4eb269e797b26c41e64dc92d27f5dd54a6ed42192ba66ca2a32274cdc4cdc6c
 SHA512:
-  metadata.gz: 568056f6ad3038dda236d889b09e78007767103692c514d5627a4efe0e610797e91eda827b58880c5714e357d964db7cf2040b238fbf79286108410b35592aeb
-  data.tar.gz: 3e1f01edc45fc73f094dd1d89cca164e6a2792cee0e555ab3b330f7c8cb981a5d79d2ec6003a6e9f8a39f6ec8d651b8d3d36645415a7156b6ab8e72cad4d41bb
+  metadata.gz: da77a826c9b614ab96717a5c982ca89e9c1d14e947277a10e2cd0c267871f16f2b50356b80afe8d8f8f0a954e5968fba167f9758c3b65b9370f64e4fed1bbc23
+  data.tar.gz: f950c03d0b707ac672fa0adb3a80ff7fd6ad8ddfd92e50abdffda4f36dd0e7d67ec73ca5eb815783d40f222336e2a8298cd79285b5d95f4447affc7333467e1a

data/ChangeLog

@@ -1,4 +1,30 @@
-2019-01 Release 0.5.5
+2022-08 Release 0.5.9
+
+Dan Čermák
+ * Drop lazy priority queue (#64) (3b1db1)
+
+2022-06 Release 0.5.8
+
+Horst Duchene
+ * switch to github actions (56030d)
+
+2020-12 Release 0.5.7
+
+Horst Duchene
+ * Fully automate dev setup with Gitpod (41dd00)
+ * Add Dockerfile to install graphviz (2bd738)
+ * Examples do not call dotty (6bba96)
+ * Add ruby license file (a21aa5)
+ujihisa <ujihisa@users.noreply.github.com>
+ * Test against Ruby 2.6 and 2.7 as well (50ac7c)
+ * Fix dead links (9184f3)
+Harry Lascelles <hlascelles@users.noreply.github.com>
+ * Update .travis.yml (45b9a2)
+ * Make the links more explicit (95dc3b)
+Harry Lascelles
+ * Add explicit license to gemspec (de3647)
+
+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

data/README.md

@@ -1,22 +1,21 @@
-# Ruby Graph Library (RGL) [<img src="https://secure.travis-ci.org/monora/rgl.png?branch=master" alt="Build Status" />](https://travis-ci.org/monora/rgl) [<img src="https://codeclimate.com/github/monora/rgl/badges/coverage.svg" />](https://codeclimate.com/github/monora/rgl/coverage) [<img src="https://badge.fury.io/rb/rgl.svg" alt="Version"/>](https://badge.fury.io/rb/rgl)
+# Ruby Graph Library (RGL) [![test](https://github.com/monora/rgl/actions/workflows/ruby.yml/badge.svg)](https://github.com/monora/rgl/actions/workflows/ruby.yml) [<img src="https://codeclimate.com/github/monora/rgl/badges/coverage.svg" />](https://codeclimate.com/github/monora/rgl/coverage) [<img src="https://badge.fury.io/rb/rgl.svg" alt="Version"/>](https://badge.fury.io/rb/rgl) [![Gitpod ready-to-code](https://img.shields.io/badge/Gitpod-ready--to--code-blue?logo=gitpod)](https://gitpod.io/#https://github.com/monora/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++. 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
 
@@ -123,6 +117,8 @@ After that you can run the tests:
 
 ## Example irb session with RGL
 
+    % irb -Ilib
+
     irb> require 'rgl/adjacency'
     irb> dg=RGL::DirectedAdjacencyGraph[1,2 ,2,3 ,2,4, 4,5, 6,4, 1,6]
     # Use DOT to visualize this graph:
@@ -227,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
@@ -237,28 +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 by Horst Duchene. It is
-free software, and may be redistributed under the terms specified in the
-README file of the Ruby distribution.
+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/Rakefile

@@ -15,7 +15,7 @@ require 'rgl/base' # require base module to get RGL_VERSION
 SOURCES = FileList['lib/**/*.rb']
 
 # The default task is run if rake is given no explicit arguments.
-desc "Default Task"
+desc 'Default Task'
 task :default => :test
 
 # Define a test task.
@@ -28,7 +28,7 @@ end
 
 # Git tagging
 
-desc "Commit all changes as a new version commit. Tag the commit with v<version> tag"
+desc 'Commit all changes as a new version commit. Tag the commit with v<version> tag'
 task :tag do
   puts "Committing and tagging version #{RGL_VERSION}"
   `git commit -am 'Version #{RGL_VERSION}'`
@@ -44,13 +44,13 @@ Bundler::GemHelper.install_tasks
 # TAGS ---------------------------------------------------------------
 
 file 'tags' => SOURCES do
-  print "Running ctags..."
-  sh %{ctags #{SOURCES.join(' ')}}             # vi tags
-  puts "done."
+  print 'Running ctags...'
+  sh %(ctags #{SOURCES.join(' ')}) # vi tags
+  puts 'done.'
 end
 
 file 'TAGS' => SOURCES do
-  sh %{etags #{SOURCES.join(' ')}}          # emacs TAGS
+  sh %(etags #{SOURCES.join(' ')}) # emacs TAGS
 end
 
 # Misc tasks =========================================================
@@ -73,34 +73,34 @@ def show_line(msg, lines, loc)
   printf "%6s %6s   %s\n", lines.to_s, loc.to_s, msg
 end
 
-desc "Count lines in the main files"
+desc 'Count lines in the main files'
 task :lines do
   total_lines = 0
   total_code = 0
-  show_line("File Name", "LINES", "LOC")
+  show_line('File Name', 'LINES', 'LOC')
   SOURCES.each do |fn|
     lines, codelines = count_lines(fn)
     show_line(fn, lines, codelines)
     total_lines += lines
-    total_code  += codelines
+    total_code += codelines
   end
-  show_line("TOTAL", total_lines, total_code)
+  show_line('TOTAL', total_lines, total_code)
 end
 
 # simple rake task to output a changelog between two commits, tags ...
 # output is formatted simply, commits are grouped under each author name
 #
-desc "generate changelog with nice clean output"
-task :changelog, :since_c, :until_c do |t,args|
+desc 'generate changelog with nice clean output'
+task :changelog, :since_c, :until_c do |t, args|
   since_c = args[:since_c] || `git tag | tail -1`.chomp
   until_c = args[:until_c]
-  cmd=`git log --pretty='format:%ci::%an <%ae>::%s::%H' #{since_c}..#{until_c}`
+  cmd = `git log --pretty='format:%ci::%an <%ae>::%s::%H' #{since_c}..#{until_c}`
 
   entries = Hash.new
   changelog_content = String.new
 
   cmd.split("\n").each do |entry|
-    _, author, subject, hash = entry.chomp.split("::")
+    _, author, subject, hash = entry.chomp.split('::')
     entries[author] = Array.new unless entries[author]
     entries[author] << "#{subject} (#{hash[0..5]})" unless subject =~ /Merge/
   end

data/examples/examples.rb

@@ -77,7 +77,7 @@ def bfs_example(g = cycle(5), start = g.detect { |x| true })
 end
 
 # Would like to have GraphXML here
-def graph_from_dotfile (file)
+def graph_from_dotfile(file)
   g = RGL::AdjacencyGraph.new
   pattern = /\s*([^\"]+)[\"\s]*--[\"\s]*([^\"\[\;]+)/ # ugly but works
   IO.foreach(file) { |line|
@@ -94,21 +94,23 @@ def graph_from_dotfile (file)
   g
 end
 
-# ruby -Ilib -r examples/examples.rb -rrgl/dot -e'bfs_example(module_graph,RGL::AdjacencyGraph).dotty'
-
+# ruby -Ilib examples/examples.rb
 if $0 == __FILE__
   require 'rgl/dot'
 
   dg = RGL::DirectedAdjacencyGraph[1,2, 2,3, 2,4, 4,5, 6,4, 1,6]
-  dg.dotty
   dg.write_to_graphic_file
-  bfs_example(dg, 1).dotty
-  bfs_example(graph_from_dotfile('dot/unix.dot'), 'Interdata').dotty({ 'label' => 'Interdata Nachfolger', 'fontsize' => 12 })
 
+  # BFS tree from 1 of dg:
+  bfs_example(dg, 1).write_to_graphic_file('png', 'bfs_example')
+
+  # Unix history as a graph:
+  g = bfs_example(graph_from_dotfile('examples/unix.dot'), 'Interdata')
+  g.write_to_graphic_file('png', 'unix', { 'label' => 'Interdata Nachfolger', 'fontsize' => 12 })
+
+  # Modules included by AdjacencyGraph:
   g = module_graph
   tree = bfs_example(module_graph, RGL::AdjacencyGraph)
   g = g.vertices_filtered_by { |v| tree.has_vertex? v }
-  g.write_to_graphic_file
-  g.dotty
+  g.write_to_graphic_file('png', 'module_graph')
 end
-

data/examples/unix.dot

@@ -0,0 +1,53 @@
+/* courtesy Ian Darwin and Geoff Collyer, Softquad Inc. */
+digraph unix {
+size="6,6";
+	"5th Edition" -> "6th Edition";
+	"5th Edition" -> "PWB 1.0";
+	"6th Edition" -> "LSX";
+	"6th Edition" -> "1 BSD";
+	"6th Edition" -> "Mini Unix";
+	"6th Edition" -> "Wollongong";
+	"6th Edition" -> "Interdata";
+	"Interdata" -> "Unix/TS 3.0";
+	"Interdata" -> "PWB 2.0";
+	"Interdata" -> "7th Edition";
+	"7th Edition" -> "8th Edition";
+	"7th Edition" -> "32V";
+	"7th Edition" -> "V7M";
+	"7th Edition" -> "Ultrix-11";
+	"7th Edition" -> "Xenix";
+	"7th Edition" -> "UniPlus+";
+	"V7M" -> "Ultrix-11";
+	"8th Edition" -> "9th Edition";
+	"1 BSD" -> "2 BSD";
+	"2 BSD" -> "2.8 BSD";
+	"2.8 BSD" -> "Ultrix-11";
+	"2.8 BSD" -> "2.9 BSD";
+	"32V" -> "3 BSD";
+	"3 BSD" -> "4 BSD";
+	"4 BSD" -> "4.1 BSD";
+	"4.1 BSD" -> "4.2 BSD";
+	"4.1 BSD" -> "2.8 BSD";
+	"4.1 BSD" -> "8th Edition";
+	"4.2 BSD" -> "4.3 BSD";
+	"4.2 BSD" -> "Ultrix-32";
+	"PWB 1.0" -> "PWB 1.2";
+	"PWB 1.0" -> "USG 1.0";
+	"PWB 1.2" -> "PWB 2.0";
+	"USG 1.0" -> "CB Unix 1";
+	"USG 1.0" -> "USG 2.0";
+	"CB Unix 1" -> "CB Unix 2";
+	"CB Unix 2" -> "CB Unix 3";
+	"CB Unix 3" -> "Unix/TS++";
+	"CB Unix 3" -> "PDP-11 Sys V";
+	"USG 2.0" -> "USG 3.0";
+	"USG 3.0" -> "Unix/TS 3.0";
+	"PWB 2.0" -> "Unix/TS 3.0";
+	"Unix/TS 1.0" -> "Unix/TS 3.0";
+	"Unix/TS 3.0" -> "TS 4.0";
+	"Unix/TS++" -> "TS 4.0";
+	"CB Unix 3" -> "TS 4.0";
+	"TS 4.0" -> "System V.0";
+	"System V.0" -> "System V.2";
+	"System V.2" -> "System V.3";
+}

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.6"
+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
 

data/lib/rgl/graphxml.rb

@@ -1,7 +1,7 @@
 # graphxml.rb
 #
 # This file contains minimal support for creating RGL graphs from the GraphML
-# format (see http://www.graphdrawing.org/graphml). The main purpose is to
+# format (see http://graphml.graphdrawing.org/). The main purpose is to
 # have a rich set of example graphs to have some more tests.
 #
 # See the examples directory, which contains a subdirectory _north_ with the
@@ -48,7 +48,7 @@ module RGL
     end # class MutableGraphParser
 
     # Initializes an RGL graph from a subset of the GraphML format given in
-    # +source+ (see http://www.graphdrawing.org/graphml).
+    # +source+ (see http://graphml.graphdrawing.org/).
     #
     def from_graphxml(source)
       listener = MutableGraphParser.new(self)

data/lib/rgl/rdot.rb

@@ -328,7 +328,7 @@ module RGL
       # :call-seq:
       #   graph << element -> graph
       #
-      def << (element)
+      def <<(element)
         @elements << element
         self
       end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: rgl
 version: !ruby/object:Gem::Version
-  version: 0.5.6
+  version: 0.5.9
 platform: ruby
 authors:
 - Horst Duchene
@@ -9,7 +9,7 @@ authors:
 autorequire: rgl/base
 bindir: bin
 cert_chain: []
-date: 2019-08-23 00:00:00.000000000 Z
+date: 2022-08-29 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: stream
@@ -17,28 +17,48 @@ dependencies:
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: 0.5.2
+        version: 0.5.3
   type: :runtime
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: 0.5.2
+        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.3.0
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 0.3.0
+- !ruby/object:Gem::Dependency
+  name: rexml
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: 0.1.0
+        version: '3.2'
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 3.2.4
   type: :runtime
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: 0.1.0
+        version: '3.2'
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 3.2.4
 - !ruby/object:Gem::Dependency
   name: rake
   requirement: !ruby/object:Gem::Requirement
@@ -165,6 +185,7 @@ files:
 - examples/north/g.14.9.graphml
 - examples/north2.rb
 - examples/rdep-rgl.rb
+- examples/unix.dot
 - lib/rgl/adjacency.rb
 - lib/rgl/base.rb
 - lib/rgl/bellman_ford.rb
@@ -214,9 +235,10 @@ files:
 - test/traversal_test.rb
 - test/undirected_graph_test.rb
 homepage: https://github.com/monora/rgl
-licenses: []
+licenses:
+- ruby
 metadata: {}
-post_install_message: 
+post_install_message:
 rdoc_options:
 - "--title"
 - RGL - Ruby Graph Library
@@ -236,8 +258,8 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.0.6
-signing_key: 
+rubygems_version: 3.2.3
+signing_key:
 specification_version: 4
 summary: Ruby Graph Library
 test_files: []