rgl 0.4.0 → 0.5.0

metadata

@@ -1,184 +1,265 @@
---- !ruby/object:Gem::Specification 
+--- !ruby/object:Gem::Specification
 name: rgl
-version: !ruby/object:Gem::Version 
-  version: 0.4.0
+version: !ruby/object:Gem::Version
+  version: 0.5.0
+  prerelease: 
 platform: ruby
-authors: 
+authors:
 - Horst Duchene
+- Kirill Lashuk
 autorequire: rgl/base
 bindir: bin
 cert_chain: []
-
-date: 2008-08-27 00:00:00 -05:00
-default_executable: 
-dependencies: 
-- !ruby/object:Gem::Dependency 
+date: 2014-12-15 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
   name: stream
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: 0.5.0
   type: :runtime
-  version_requirement: 
-  version_requirements: !ruby/object:Gem::Requirement 
-    requirements: 
-    - - ">="
-      - !ruby/object:Gem::Version 
-        version: "0.5"
-    version: 
-- !ruby/object:Gem::Dependency 
-  name: rake
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: 0.5.0
+- !ruby/object:Gem::Dependency
+  name: algorithms
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: 0.5.0
   type: :runtime
-  version_requirement: 
-  version_requirements: !ruby/object:Gem::Requirement 
-    requirements: 
-    - - ">="
-      - !ruby/object:Gem::Version 
-        version: "0"
-    version: 
-description: "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 currently contains a core set of algorithm patterns:  * Breadth First Search  * Depth First Search   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:  * Topological Sort  * Connected Components  * Strongly Connected Components  * Transitive Closure * Transitive Reduction * Graph Condensation * Search cycles (contributed by Shawn Garbett)"
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: 0.5.0
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: rdoc
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: yard
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+description: RGL is a framework for graph data structures and algorithms
 email: monora@gmail.com
 executables: []
-
 extensions: []
-
-extra_rdoc_files: 
-- README
-files: 
-- install.rb
-- Rakefile
+extra_rdoc_files:
+- README.rdoc
+files:
+- lib/rgl/dijkstra.rb
+- lib/rgl/edmonds_karp.rb
+- lib/rgl/graphxml.rb
+- lib/rgl/edge_properties_map.rb
+- lib/rgl/transitiv_closure.rb
+- lib/rgl/condensation.rb
+- lib/rgl/topsort.rb
+- lib/rgl/path_builder.rb
+- lib/rgl/bellman_ford.rb
+- lib/rgl/graph_visitor.rb
+- lib/rgl/bidirectional.rb
+- lib/rgl/rdot.rb
+- lib/rgl/prim.rb
+- lib/rgl/adjacency.rb
+- lib/rgl/implicit.rb
+- lib/rgl/traversal.rb
+- lib/rgl/base.rb
+- lib/rgl/dot.rb
+- lib/rgl/graph_iterator.rb
+- lib/rgl/enumerable_ext.rb
+- lib/rgl/dijkstra_visitor.rb
+- lib/rgl/mutable.rb
+- lib/rgl/connected_components.rb
+- lib/rgl/transitivity.rb
+- lib/rgl/graph_wrapper.rb
+- lib/rgl/bipartite.rb
 - ChangeLog
-- README
-- tests/TestGraph.rb
-- tests/TestUnDirectedGraph.rb
-- tests/TestTransitivity.rb
-- tests/TestTraversal.rb
-- tests/TestDot.rb
-- tests/TestEdge.rb
-- tests/TestDirectedGraph.rb
-- tests/TestRdot.rb
-- tests/TestCycles.rb
-- tests/TestImplicit.rb
-- tests/test_helper.rb
-- tests/TestGraphXML.rb
-- tests/TestComponents.rb
-- examples/insel-der-tausend-gefahren.rb
+- examples/images/module_graph.jpg
+- examples/images/example.jpg
+- examples/images/rgl_modules.png
+- examples/insel_der_tausend_gefahren.rb
+- examples/rdep-rgl.rb
+- examples/graph.dot
+- examples/north2.rb
 - examples/canvas.rb
 - examples/north.rb
-- examples/north2.rb
-- examples/example.jpg
-- examples/module_graph.jpg
-- examples/examples.rb
-- examples/rdep-rgl.rb
-- examples/north
-- examples/north/g.10.75.graphml
-- examples/north/g.10.0.graphml
-- examples/north/g.10.41.graphml
-- examples/north/g.10.93.graphml
-- examples/north/g.10.7.graphml
+- examples/north/g.10.45.graphml
+- examples/north/g.10.6.graphml
+- examples/north/g.10.56.graphml
+- examples/north/g.10.8.graphml
+- examples/north/g.10.29.graphml
 - examples/north/g.10.30.graphml
+- examples/north/g.10.37.graphml
+- examples/north/Graph.log
 - examples/north/g.10.20.graphml
-- examples/north/g.10.89.graphml
-- examples/north/g.10.78.graphml
+- examples/north/g.10.9.graphml
+- examples/north/g.10.74.graphml
+- examples/north/g.10.61.graphml
+- examples/north/g.12.8.graphml
+- examples/north/g.10.71.graphml
+- examples/north/g.10.7.graphml
+- examples/north/g.10.38.graphml
+- examples/north/g.10.15.graphml
+- examples/north/g.10.50.graphml
 - examples/north/g.10.19.graphml
-- examples/north/g.10.86.graphml
+- examples/north/g.10.62.graphml
+- examples/north/g.10.31.graphml
 - examples/north/g.10.92.graphml
-- examples/north/g.10.38.graphml
-- examples/north/g.10.14.graphml
-- examples/north/g.10.2.graphml
-- examples/north/g.10.46.graphml
-- examples/north/g.10.72.graphml
-- examples/north/g.10.24.graphml
-- examples/north/g.10.45.graphml
 - examples/north/g.10.88.graphml
-- examples/north/g.10.82.graphml
-- examples/north/g.10.27.graphml
-- examples/north/g.10.31.graphml
-- examples/north/g.10.1.graphml
-- examples/north/g.10.25.graphml
-- examples/north/g.10.71.graphml
-- examples/north/g.10.50.graphml
-- examples/north/g.12.8.graphml
 - examples/north/g.10.91.graphml
-- examples/north/g.10.69.graphml
-- examples/north/g.10.13.graphml
-- examples/north/g.14.9.graphml
-- examples/north/g.10.42.graphml
-- examples/north/g.10.79.graphml
-- examples/north/g.10.39.graphml
+- examples/north/g.10.93.graphml
 - examples/north/g.10.16.graphml
-- examples/north/Graph.log
+- examples/north/g.10.90.graphml
+- examples/north/g.10.34.graphml
+- examples/north/g.10.0.graphml
+- examples/north/g.10.27.graphml
+- examples/north/g.10.82.graphml
+- examples/north/g.10.5.graphml
+- examples/north/g.10.17.graphml
+- examples/north/g.10.39.graphml
 - examples/north/g.10.94.graphml
+- examples/north/g.10.41.graphml
+- examples/north/g.10.70.graphml
 - examples/north/g.10.68.graphml
-- examples/north/g.10.80.graphml
-- examples/north/g.10.37.graphml
-- examples/north/g.10.61.graphml
+- examples/north/g.10.72.graphml
+- examples/north/g.10.86.graphml
+- examples/north/g.10.79.graphml
+- examples/north/g.10.85.graphml
+- examples/north/g.10.42.graphml
 - examples/north/g.10.83.graphml
-- examples/north/g.10.5.graphml
-- examples/north/g.10.11.graphml
+- examples/north/g.10.24.graphml
+- examples/north/g.10.13.graphml
+- examples/north/g.10.75.graphml
+- examples/north/g.10.22.graphml
+- examples/north/g.10.89.graphml
+- examples/north/g.10.12.graphml
+- examples/north/g.10.46.graphml
 - examples/north/g.10.40.graphml
+- examples/north/g.10.3.graphml
+- examples/north/g.10.80.graphml
+- examples/north/g.10.11.graphml
+- examples/north/g.10.57.graphml
+- examples/north/g.10.69.graphml
 - examples/north/g.10.4.graphml
-- examples/north/g.10.90.graphml
+- examples/north/g.10.78.graphml
+- examples/north/g.14.9.graphml
 - examples/north/g.10.58.graphml
-- examples/north/g.10.15.graphml
-- examples/north/g.10.8.graphml
-- examples/north/g.10.6.graphml
-- examples/north/g.10.22.graphml
-- examples/north/g.10.9.graphml
-- examples/north/g.10.57.graphml
-- examples/north/g.10.29.graphml
-- examples/north/g.10.85.graphml
-- examples/north/g.10.70.graphml
-- examples/north/g.10.62.graphml
-- examples/north/g.10.17.graphml
-- examples/north/g.10.34.graphml
-- examples/north/g.10.56.graphml
-- examples/north/g.10.12.graphml
-- examples/north/g.10.74.graphml
-- examples/north/g.10.28.graphml
 - examples/north/g.10.60.graphml
-- examples/north/g.10.3.graphml
+- examples/north/g.10.1.graphml
+- examples/north/g.10.25.graphml
+- examples/north/g.10.14.graphml
+- examples/north/g.10.28.graphml
+- examples/north/g.10.2.graphml
+- examples/examples.rb
+- Gemfile
+- README.rdoc
+- Rakefile
 - rakelib/dep_graph.rake
-- lib/rgl/enumerable_ext.rb
-- lib/rgl/transitiv_closure.rb
-- lib/rgl/graphxml.rb
-- lib/rgl/condensation.rb
-- lib/rgl/connected_components.rb
-- lib/rgl/adjacency.rb
-- lib/rgl/dot.rb
-- lib/rgl/base.rb
-- lib/rgl/rdot.rb
-- lib/rgl/mutable.rb
-- lib/rgl/bidirectional.rb
-- lib/rgl/transitivity.rb
-- lib/rgl/topsort.rb
-- lib/rgl/traversal.rb
-- lib/rgl/implicit.rb
-has_rdoc: true
-homepage: http://rgl.rubyforge.org
+- test/dijkstra_test.rb
+- test/prim_test.rb
+- test/dot_test.rb
+- test/graph_xml_test.rb
+- test/edge_test.rb
+- test/edmonds_karp_test.rb
+- test/traversal_test.rb
+- test/edge_properties_map_test.rb
+- test/graph_test.rb
+- test/undirected_graph_test.rb
+- test/components_test.rb
+- test/implicit_test.rb
+- test/directed_graph_test.rb
+- test/bellman_ford_test.rb
+- test/rdot_test.rb
+- test/cycles_test.rb
+- test/test_helper.rb
+- test/transitivity_test.rb
+- test/bipartite_test.rb
+homepage: https://github.com/monora/rgl
+licenses: []
 post_install_message: 
-rdoc_options: 
+rdoc_options:
 - --title
 - RGL - Ruby Graph Library
 - --main
-- README
+- README.rdoc
 - --line-numbers
-require_paths: 
+require_paths:
 - lib
-required_ruby_version: !ruby/object:Gem::Requirement 
-  requirements: 
-  - - ">="
-    - !ruby/object:Gem::Version 
-      version: "0"
-  version: 
-required_rubygems_version: !ruby/object:Gem::Requirement 
-  requirements: 
-  - - ">="
-    - !ruby/object:Gem::Version 
-      version: "0"
-  version: 
-requirements: 
-- Stream library, v0.5 or later
-rubyforge_project: rgl
-rubygems_version: 1.2.0
+required_ruby_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+      segments:
+      - 0
+      hash: -105297123
+required_rubygems_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+      segments:
+      - 0
+      hash: -105297123
+requirements: []
+rubyforge_project: 
+rubygems_version: 1.8.23
 signing_key: 
-specification_version: 2
+specification_version: 3
 summary: Ruby Graph Library
 test_files: []
-
+has_rdoc: true

data/install.rb

@@ -1,49 +0,0 @@
-#! /usr/bin/env ruby
-
-require 'getoptlong'
-require 'rbconfig'
-require 'ftools'
-require 'find'
-
-SRC_BASE = 'lib'
-SRC = 'rgl'
-
-
-INSTDIR = File.join Config::CONFIG['sitedir']
-DESTDIR = File.join INSTDIR, SRC
-
-opts = GetoptLong.new( [ "--uninstall",	"-u",		GetoptLong::NO_ARGUMENT ] )
-
-def install
-  begin
-    File.makedirs( DESTDIR )
-    pwd = Dir.pwd
-    Dir.chdir(SRC_BASE)
-	Dir['*.rb'].each do |file|
-      dst = File.join( INSTDIR, file )
-      File.install(file, dst, 0644, true)
-    end
-    Find.find(SRC) do |file|
-      dst = File.join( INSTDIR, file )
-      File.install(file, dst, 0644, true) if file =~ /.rb$/
-    end
-    Dir.chdir(pwd)
-  rescue
-    puts $!
-  end
-end
-
-def uninstall
-  begin
-    puts "Deleting:"
-    Find.find(DESTDIR) { |file| File.rm_f file,true }
-    Dir.delete DESTDIR
-  rescue
-  end
-end
-
-if (opt = opts.get) and opt[0] =~ /^-?-u/
-  uninstall
-else
-  install
-end