graphunk 0.2.0 → 0.2.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 46c47981120e7088ae585e40b7402ccf1564ce06
-  data.tar.gz: 5f9024dd3e9c0b16923da07509d1c7899f5925c2
+  metadata.gz: 3484b513a6924db90db6cef1e4d1a3a0c998e888
+  data.tar.gz: ced748e00283f8199d5b63ae25d7239232e46439
 SHA512:
-  metadata.gz: 16fd98c21c9d45c123295f3f83c60234d2f073f68b7ee4f56a53fd667f1b76046a25c8ff6147e69c4ceb5a6f4c4f8b2053793448fb9e1cd4e7f76b4b76a3429e
-  data.tar.gz: b5d498ad86b94efbe7dd8eeae32ca70e9c8a12724374274c23106a651b8f254bac7db8aed9bb9bf5a38c32a743560e0b175e77ecdc1d21d7204c32059ed6355f
+  metadata.gz: 0ec2a5140951c25f4d21bc1b12e03c304870151a29651c0b3e1ebc2a77657ccd9132acf93085e53d1e94c4dffc93d12be91fd34e68291ecfaa7f34847e805f1b
+  data.tar.gz: 4aed0d585553025fe18facdfb860683ded5344803539aaded60056e4309038f5047021af6f12e38a44df82394ae0a17a64cede86aa8fe36ec98142aa22c6f114

data/lib/directed_graph.rb

@@ -0,0 +1,32 @@
+require 'graph'
+class DirectedGraph < Graph
+  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)
+      self[first_vertex] << second_vertex
+    else
+      raise ArgumentError, "One of the vertices referenced does not exist in the graph"
+    end
+  end
+
+  def remove_edge(first_vertex, second_vertex)
+    if edge_exists?(first_vertex, second_vertex)
+      self[first_vertex].delete(second_vertex)
+    else
+      raise ArgumentError, "That edge does not exist in the graph"
+    end
+  end
+
+  def neighbors_of_vertex(name)
+    if vertex_exists?(name)
+      self[name]
+    else
+      raise ArgumentError, "That vertex does not exist in the graph"
+    end
+  end
+
+  def edge_exists?(first_vertex, second_vertex)
+    edges.include?([first_vertex, second_vertex])
+  end
+end

data/lib/undirected_graph.rb

@@ -0,0 +1,145 @@
+require 'graph'
+require 'set'
+
+class UndirectedGraph < Graph
+  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_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 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 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

metadata

@@ -1,25 +1,27 @@
 --- !ruby/object:Gem::Specification
 name: graphunk
 version: !ruby/object:Gem::Version
-  version: 0.2.0
+  version: 0.2.1
 platform: ruby
 authors:
 - Evan Hemsley
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2010-04-28 00:00:00.000000000 Z
+date: 2014-02-27 00:00:00.000000000 Z
 dependencies: []
-description: This gem defines a Graph class which is useful in various mathematical
+description: This gem defines graph classes which are useful in various mathematical
   applications.
 email: evan.hemsley@gmail.com
 executables: []
 extensions: []
 extra_rdoc_files: []
 files:
+- lib/directed_graph.rb
 - lib/graph.rb
 - lib/graphunk.rb
-homepage: http://rubygems.org/gems/graphunk
+- lib/undirected_graph.rb
+homepage: https://github.com/ehemsley/graphunk
 licenses:
 - MIT
 metadata: {}