bipartite_graph_sets 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: b6a4aeab824e381cd2bbf826c8d4ea741905799e75536cd5673331efc6cfdf7a
+  data.tar.gz: 4c6bada9a2c85808fdb64132e4a07b987f8b574f15bb922d6bd4988d60610d2f
+SHA512:
+  metadata.gz: d93bfefe1d1e0ce09c22554118243999dd707eb8fd499e0bd06f91f01d4ba37e400e0d107f2c2113158e80e7e40d76cb535b2e7abf1e5a1cf2136e8e48fd3eed
+  data.tar.gz: c06cc9b465274540a8238480375dc684f90b6ef7001e2eb7365a84ed795aca583ae2a539c93063a98255a37443c5e2dc5b4bf09a4bb3cbe7ce03ed2298d1e991

data/lib/bipartite_graph.rb

@@ -0,0 +1,73 @@
+class BipartiteGraph
+
+  def self.match(left_vertices, right_vertices, edges)
+    vertices = left_vertices + right_vertices + [:sink, :source]
+    edges[:sink] = {}
+    edges[:source] = {}
+    
+    left_vertices.each do |left_vertice|
+      edges[:source][left_vertice] = 0
+    end
+    right_vertices.each do |right_vertice|
+      edges[right_vertice] = { sink: 0 }
+    end
+    graph = { vertices: vertices, edges: edges }
+    matching = graph_matching! graph
+  end
+
+  def self.graph_matching!(graph, source = :source, sink = :sink)
+    loop do
+      path = get_augmenting_path graph
+      break unless path
+      create_augment_flow graph, path
+    end
+    matching_in graph, source, sink
+  end
+
+  def self.get_augmenting_path(graph, source = :source, sink = :sink)
+    parents = search graph, source, sink
+    return nil unless parents[sink]
+    path = []
+    current_vertex = sink
+    until current_vertex == source
+      path << [parents[current_vertex], current_vertex]
+      current_vertex = parents[current_vertex]
+
+      if path.length > parents.length
+        raise "Cannot terminate. Use integral edge weights."
+      end
+    end
+    path.reverse!
+  end
+
+  def self.create_augment_flow (graph, path)
+    edges = graph[:edges]
+    path.each do |u, v|
+      edges[v] ||= {}
+      edges[v][u] = -edges[u][v]
+      edges[u].delete v
+    end
+  end
+
+  def self.search(graph, source = :source, sink = :sink)
+    parents = { source => true }
+    queue = [source]
+    until queue.empty?
+      current_vertex = queue.shift
+      break if current_vertex == sink
+      (graph[:edges][current_vertex] || {}).each do |new_vertex, edge|
+        next if parents[new_vertex]
+        parents[new_vertex] = current_vertex
+        queue << new_vertex
+      end
+    end
+
+    parents
+  end
+
+  def self.matching_in(graph, source = :source, sink = :sink)
+    Hash[*((graph[:edges][sink] || {}).keys.map { |matched_vertex|
+      [graph[:edges][matched_vertex].keys.first, matched_vertex]
+    }.flatten)]
+  end
+end

data/lib/bipartite_graph_sets.rb

@@ -0,0 +1,38 @@
+require_relative 'bipartite_graph'
+
+class BipartiteGraphSets
+
+  def self.get_perfect_match requirement_hash
+    left_vertices, right_vertices, edges = get_vertices_and_edges requirement_hash
+    problem_set_matching = BipartiteGraph.match left_vertices, right_vertices, edges
+    matched_solution problem_set_matching
+  end
+
+  def self.get_vertices_and_edges requirement_hash
+    left_vertices = []
+    right_vertices = []
+    edges = {}
+    requirement_hash.each do |key, value|
+       left_vertices << value[:options]
+       value[:options].each do |v|
+        edges[v] ||= {}
+        (1..value[:selection]).each do |n|
+          key_name = "#{key}_#{n}"
+          right_vertices << key_name
+          edges[v][key_name] = 0
+        end
+      end
+    end
+    [ left_vertices.flatten.uniq.shuffle, right_vertices.flatten.uniq.shuffle, edges ]
+  end
+
+  def self.matched_solution problem_set_matching
+    solution_hash = {}
+    problem_set_matching.to_h.each do |k,v|
+      key = v.to_s.split('_').first
+      solution_hash[key] ||= []
+      solution_hash[key] << k
+    end
+    solution_hash
+  end
+end

metadata

@@ -0,0 +1,46 @@
+--- !ruby/object:Gem::Specification
+name: bipartite_graph_sets
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- Raghvendra Pratap Singh
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2019-12-06 00:00:00.000000000 Z
+dependencies: []
+description: Job assignment problem with the help of bipartite graph
+email: raghvendra1501@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/bipartite_graph.rb
+- lib/bipartite_graph_sets.rb
+homepage: https://rubygems.org/gems/bipartite_graph_sets
+licenses:
+- MIT
+metadata:
+  source_code_uri: https://github.com/raghvendra1501/bipartite_graph_sets
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.7.7
+signing_key: 
+specification_version: 4
+summary: Job assignment problem with the help of bipartite graph
+test_files: []