graphunk 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: db25940291ff0dba0ccab4d46a61f1caf520bbd4
+  data.tar.gz: 9fa3edb089b77c4075805f84dd9e135486d656e1
+SHA512:
+  metadata.gz: c1f02220f4bd9b6f650ae202d5e2f80e7cb74bb0b6ccadb13c0874dfb2e7288b1c87c79de6ae1c82a3f16f32df0a3471f0afb5725a65c248900b21616058df85
+  data.tar.gz: 8c2e00a649ad8e78a7fd6ed71cff5c74b104de15124e75db4af78ff1280b18fb570ff6c5f14713a93677732238f095d107114853b9a97efd17713dc4c37e4b4c

data/lib/graph.rb

@@ -0,0 +1,191 @@
+require 'set'
+
+# Undirected graph
+# Vertices represented by strings
+class Graph < Hash
+  def vertices
+    keys
+  end
+
+  def edges
+    [].tap do |edge_constructor|
+      vertices.each do |vertex|
+        self[vertex].each do |neighbor|
+          edge_constructor << [vertex, neighbor]
+        end
+      end
+    end
+  end
+
+  def add_vertex(name)
+    unless vertex_exists?(name)
+      self[name] = []
+    else
+      raise ArgumentError, "Vertex already exists"
+    end
+  end
+
+  def add_edge(first_vertex, second_vertex)
+    if edge_exists?(first_vertex, second_vertex)
+      raise ArgumentError, "This edge already exists"
+    elsif vertex_exists?(first_vertex) && vertex_exists?(second_vertex)
+      ordered_vertices = order_vertices(first_vertex, second_vertex)
+      self[ordered_vertices.first] << ordered_vertices.last
+    else
+      raise ArgumentError, "One of the vertices referenced does not exist in the graph"
+    end
+  end
+
+  def remove_vertex(name)
+    if vertex_exists?(name)
+      self.each_pair do |key, value|
+        self[key].delete(name) if value.include?(name)
+      end
+      self.delete(name)
+    else
+      raise ArgumentError, "That vertex does not exist in the graph"
+    end
+  end
+
+  def remove_edge(first_vertex, second_vertex)
+    if edge_exists?(first_vertex, second_vertex)
+      ordered_vertices = order_vertices(first_vertex, second_vertex)
+      self[ordered_vertices.first].delete(ordered_vertices.last)
+    else
+      raise ArgumentError, "That edge does not exist in the graph"
+    end
+  end
+
+  def edges_on_vertex(name)
+    if vertex_exists?(name)
+      edges.select { |edge| edge.include?(name) }
+    else
+      raise ArgumentError, "That vertex does not exist in the graph"
+    end
+  end
+
+  def neighbors_of_vertex(name)
+    if vertex_exists?(name)
+      edges.select { |edge| edge.include? name }.map do |edge|
+        if edge.first == name
+          edge.last
+        else
+          edge.first
+        end
+      end
+    else
+      raise ArgumentError, "That vertex does not exist in the graph"
+    end
+  end
+
+  def edge_exists?(first_vertex, second_vertex)
+    edges.include?(order_vertices(first_vertex, second_vertex))
+  end
+
+  def vertex_exists?(name)
+    vertices.include?(name)
+  end
+
+  def lexicographic_bfs
+    sets = [vertices]
+    output_vertices = []
+
+    until sets.empty?
+      v = sets.first.delete_at(0)
+      sets.delete_at(0) if sets.first.empty?
+      output_vertices << v
+      replaced = []
+      neighbors_of_vertex(v).each do |neighbor|
+        s = sets.select{ |set| set.include?(neighbor) }.first
+        if s
+          if replaced.include?(s)
+            t = sets[sets.find_index(s)-1]
+          else
+            t = []
+            sets.insert(sets.find_index(s), t)
+            replaced << s
+          end
+          s.delete(neighbor)
+          t << neighbor
+          sets.delete(s) if s.empty?
+        end
+      end
+    end
+
+    output_vertices
+  end
+
+  def clique?(vertex_list)
+    clique = true
+    vertex_list.each do |vertex|
+      unless (neighbors_of_vertex(vertex) & vertex_list).to_set == (vertex_list - [vertex]).to_set
+        clique = false
+        break
+      end
+    end
+    clique
+  end
+
+  def chordal?
+    chordal = true
+    (lexicographic_ordering = lexicographic_bfs.reverse).each_with_index do |v, i|
+      successors_of_v = lexicographic_ordering[i, lexicographic_ordering.size]
+      unless clique?([v] | (neighbors_of_vertex(v) & successors_of_v))
+        chordal = false
+        break
+      end
+    end
+    chordal
+  end
+  alias_method :triangulated?, :chordal?
+
+  def complete?
+    n = vertices.count
+    edges.count == (n * (n-1) / 2)
+  end
+
+  def bipartite?
+    colors = Hash.new
+    d = Hash.new
+    partition = Hash.new
+    vertices.each do |vertex|
+      colors[vertex] = "white"
+      d[vertex] = Float::INFINITY
+      partition[vertex] = 0
+    end
+
+    start = vertices.first
+    colors[start] = "gray"
+    partition[start] = 1
+    d[start] = 0
+
+    stack = []
+    stack.push(start)
+
+    until stack.empty?
+      vertex = stack.pop
+      neighbors_of_vertex(vertex).each do |neighbor|
+        if partition[neighbor] == partition[vertex]
+          return false
+        else
+          if colors[neighbor] == "white"
+            colors[neighbor] == "gray"
+            d[neighbor] = d[vertex] + 1
+            partition[neighbor] = 3 - partition[vertex]
+            stack.push(neighbor)
+          end
+        end
+      end
+      stack.pop
+      colors[vertex] = "black"
+    end
+
+    true
+  end
+
+  private
+
+  def order_vertices(first_vertex, second_vertex)
+    [first_vertex, second_vertex].sort
+  end
+end

data/lib/graphunk.rb

@@ -0,0 +1 @@
+require 'graph'

metadata

@@ -0,0 +1,46 @@
+--- !ruby/object:Gem::Specification
+name: graphunk
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Evan Hemsley
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2010-04-28 00:00:00.000000000 Z
+dependencies: []
+description: This gem defines a Graph class which you can is useful in various mathematical
+  applications.
+email: evan.hemsley@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/graph.rb
+- lib/graphunk.rb
+homepage: http://rubygems.org/gems/graphunk
+licenses:
+- MIT
+metadata: {}
+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.2.2
+signing_key: 
+specification_version: 4
+summary: A funky Ruby library for working with graphs (as related to graph theory).
+test_files: []