graph_matching 0.0.2 → 0.1.0

data/spec/graph_matching/graph/graph_spec.rb

@@ -3,7 +3,7 @@
 require 'spec_helper'
 
 RSpec.describe GraphMatching::Graph::Graph do
-  ERR_MSG_INT_VERTEXES = 'All vertexes must be integers'
+  ERR_MSG_INT_VERTEXES = 'All vertexes must be integers'.freeze
 
   let(:g) { described_class.new }
 
@@ -40,13 +40,13 @@ RSpec.describe GraphMatching::Graph::Graph do
     end
   end
 
-  describe "#max_v" do
-    it "returns the largest vertex number" do
+  describe '#max_v' do
+    it 'returns the largest vertex number' do
       g = described_class[1, 3, 3, 7]
       expect(g.max_v).to eq(7)
     end
 
-    it "returns nil when graph is empty" do
+    it 'returns nil when graph is empty' do
       expect(g.max_v).to eq(nil)
     end
   end

data/spec/graph_matching/integer_vertexes_spec.rb

@@ -7,14 +7,14 @@ require 'graph_matching/integer_vertexes'
 RSpec.describe GraphMatching::IntegerVertexes do
   describe '.to_integers' do
     it 'returns new graph with vertexes converted to integers, and a legend' do
-      e = %w[a b]
+      e = %w(a b)
       g1 = RGL::AdjacencyGraph[*e]
       g2, legend = described_class.to_integers(g1)
       expect(g2.size).to eq(g1.size)
       expect(g2.vertices).to eq(1.upto(g1.size).to_a)
       expect(g2.num_edges).to eq(g1.num_edges)
       legend.keys.map(&:class).uniq.each do |klass|
-        expect(klass).to be < Integer
+        expect(klass).to(be <= ::Integer)
       end
     end
   end

data/spec/spec_helper.rb

@@ -12,8 +12,8 @@ end
 
 RSpec::Matchers.define(:match_edges) do |expected|
   match do |matching|
-    fail TypeError unless matching.is_a?(GraphMatching::Matching)
-    fail TypeError unless expected.is_a?(Array)
+    raise TypeError unless matching.is_a?(GraphMatching::Matching)
+    raise TypeError unless expected.is_a?(Array)
     se = Set.new(expected.map { |e| RGL::Edge::UnDirectedEdge.new(*e) })
     sa = Set.new(matching.undirected_edges)
     se == sa

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: graph_matching
 version: !ruby/object:Gem::Version
-  version: 0.0.2
+  version: 0.1.0
 platform: ruby
 authors:
 - Jared Beck
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2016-08-15 00:00:00.000000000 Z
+date: 2017-05-10 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rgl
@@ -39,89 +39,89 @@ dependencies:
       - !ruby/object:Gem::Version
         version: '1.12'
 - !ruby/object:Gem::Dependency
-  name: pry-nav
+  name: pry-byebug
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: 0.2.4
+        version: '3.4'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: 0.2.4
+        version: '3.4'
 - !ruby/object:Gem::Dependency
   name: rspec-core
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '3.2'
+        version: '3.6'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '3.2'
+        version: '3.6'
 - !ruby/object:Gem::Dependency
   name: rspec-expectations
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '3.2'
+        version: '3.6'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '3.2'
+        version: '3.6'
 - !ruby/object:Gem::Dependency
   name: rspec-mocks
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '3.2'
+        version: '3.6'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '3.2'
+        version: '3.6'
 - !ruby/object:Gem::Dependency
   name: rake
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '11.2'
+        version: '12.0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '11.2'
+        version: '12.0'
 - !ruby/object:Gem::Dependency
   name: rubocop
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: 0.42.0
+        version: 0.48.1
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: 0.42.0
+        version: 0.48.1
 description: |2
       Efficient algorithms for maximum cardinality
       and weighted matchings in undirected graphs.
@@ -236,7 +236,7 @@ required_ruby_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="
     - !ruby/object:Gem::Version
-      version: 2.0.0
+      version: 2.2.0
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="
@@ -244,7 +244,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 2.5.1
+rubygems_version: 2.6.12
 signing_key: 
 specification_version: 4
 summary: Finds maximum matchings in undirected graphs.