graphunk 0.1.1 → 0.2.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 6bf85b323f44506be6b4a38a0d7b89db2fa9f05b
-  data.tar.gz: 2b101ac9fa1fce04c1c193adc581dc8677a9772a
+  metadata.gz: 46c47981120e7088ae585e40b7402ccf1564ce06
+  data.tar.gz: 5f9024dd3e9c0b16923da07509d1c7899f5925c2
 SHA512:
-  metadata.gz: 6e7bce855966073d37b166f0aa1e44d3ab5913bad96da22f7d3530cf68e57228f911769385c59efbb056731abf25ba3a405b64e672f358804f3bc93aebd36604
-  data.tar.gz: b5ffd62ad6f7ea0264a7bd9bdfd3d0fa21aae20a780cf1a267a92adaeccb7cbd25b654e91c50972a10871cf812020ea79eeb9940793f5c0ecd802a944a32935b
+  metadata.gz: 16fd98c21c9d45c123295f3f83c60234d2f073f68b7ee4f56a53fd667f1b76046a25c8ff6147e69c4ceb5a6f4c4f8b2053793448fb9e1cd4e7f76b4b76a3429e
+  data.tar.gz: b5d498ad86b94efbe7dd8eeae32ca70e9c8a12724374274c23106a651b8f254bac7db8aed9bb9bf5a38c32a743560e0b175e77ecdc1d21d7204c32059ed6355f

data/lib/graph.rb

@@ -1,7 +1,4 @@
-require 'set'
-
-# Undirected graph
-# Vertices represented by strings
+# this class should not be invoked directly
 class Graph < Hash
   def vertices
     keys
@@ -25,17 +22,6 @@ class Graph < Hash
     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|
@@ -47,15 +33,6 @@ class Graph < Hash
     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) }
@@ -64,128 +41,7 @@ class Graph < Hash
     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

@@ -1 +1,2 @@
-require 'graph'
+require 'undirected_graph'
+require 'directed_graph'

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: graphunk
 version: !ruby/object:Gem::Version
-  version: 0.1.1
+  version: 0.2.0
 platform: ruby
 authors:
 - Evan Hemsley