graphmatch 1.0.0.pre

data/lib/graphmatch.rb

@@ -0,0 +1,26 @@
+class Graphmatch
+  def self.test_gem
+    "Hello, World!"
+  end
+
+  def self.match(left_vertices, right_vertices, edges, search_type='BFS')
+    vertices = left_vertices + right_vertices + [:sink, :source]
+
+    edges[:sink] = {}
+    edges[:source] = {}
+
+    left_vertices.each { |lv| edges[:source][lv] = 0 }
+    right_vertices.each { |rv| edges[rv] = { :sink => 0 } }
+
+    graph = { vertices: vertices, edges: edges }
+    puts graph
+
+    matching = Graphmatch::Maxflow.best_matching! graph
+    puts "Created matching"
+    puts matching
+
+    matching
+  end
+end
+
+require 'graphmatch/maxflow'

metadata

@@ -0,0 +1,46 @@
+--- !ruby/object:Gem::Specification
+name: graphmatch
+version: !ruby/object:Gem::Version
+  version: 1.0.0.pre
+  prerelease: 6
+platform: ruby
+authors:
+- Paul Hemberger
+- Victor Costan
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2013-02-22 00:00:00.000000000 Z
+dependencies: []
+description: An implementation of the Ford-Fulkerson max-flow algorithm
+email: pwh@mit.edu
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/graphmatch.rb
+homepage: http://rubygems.org/gems/graphmatch
+licenses: []
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>'
+    - !ruby/object:Gem::Version
+      version: 1.3.1
+requirements: []
+rubyforge_project: 
+rubygems_version: 1.8.24
+signing_key: 
+specification_version: 3
+summary: Optimal bipartite graph matching
+test_files: []