graphunk 0.5.1 → 0.5.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 9ff0347b661119632199445c609f01d8fd07d9fc
-  data.tar.gz: 935c3b73afa756a87f2da992bbd42d82d547af75
+  metadata.gz: 4679baf01a1d4c718afdf767d902cc84a707721e
+  data.tar.gz: 0321ab012c5fba8ae85d33c37e6f9e58e9aac334
 SHA512:
-  metadata.gz: b955f831aa123e020487a7ae68d31d0f7907788f570f051994c4542365cff75b60c72fa114dfc839381e9409325de61ef49a52c8bdde44dd83f20b2b963722ae
-  data.tar.gz: b750d42d89a06b7acb63126ed98d00e27d71a618608acc502c036657e177305a883ce15a017426ade67863a8a18214f48267deb3f7753f8c2e83942d8c70f77a
+  metadata.gz: a918a86dad048a85b9300ab14f781ed8b313fcd433348ea7660eeecfaf40c40700681196c9316d0a2b295004e8042adb82b6d78e36204d2bafa102feeca47eab
+  data.tar.gz: 05bd5782911aeb7c4159dc6cb1d21eddb70944a86081dedf6c254245bf23cae8204f33dc82123dda3aefd50ea2d1a63395f34120759afa5b3ba32528f77fd126

data/lib/graphunk/directed_graph.rb

@@ -105,5 +105,28 @@ module Graphunk
     def topological_sort
       dfs.sort_by { |vertex, times| times[:finish] }.map(&:first).reverse
     end
+
+    def transitive?
+      transitive = true
+      vertices.each do |vertex|
+        reachable_by_two_edges(vertex).each do |reachable|
+          transitive = false unless neighbors_of_vertex(vertex).include?(reachable)
+        end
+      end
+      transitive
+    end
+
+    private
+
+    def reachable_by_two_edges(start)
+      reachable_by_two = []
+      reachable_by_one = neighbors_of_vertex(start)
+      reachable_by_one.each do |v|
+        neighbors_of_vertex(v).each do |u|
+          reachable_by_two << u
+        end
+      end
+      reachable_by_two
+    end
   end
 end

data/lib/graphunk/undirected_graph.rb

@@ -20,6 +20,22 @@ module Graphunk
       end
     end
 
+    def degree(vertex)
+      neighbors_of_vertex(vertex).count
+    end
+
+    def adjacent_edges?(first_edge, second_edge)
+      adjacent_edges(first_edge).include? second_edge
+    end
+
+    def adjacent_edges(v, u)
+      if edge_exists?(v, u)
+        edges.select { |edge| edge.include?(v) || edge.include?(u) } - [[v,u]]
+      else
+        raise ArgumentError, "That edge does not exist in the graph"
+      end
+    end
+
     def lexicographic_bfs
       sets = [vertices]
       output_vertices = []
@@ -63,7 +79,7 @@ module Graphunk
     def chordal?
       chordal = true
       (lexicographic_ordering = lexicographic_bfs.reverse).each_with_index do |v, i|
-        successors_of_v = lexicographic_ordering[i, lexicographic_ordering.size]
+        successors_of_v = lexicographic_ordering[i..-1]
         unless clique?([v] | (neighbors_of_vertex(v) & successors_of_v))
           chordal = false
           break
@@ -116,5 +132,66 @@ module Graphunk
 
       true
     end
+
+    def comparability?
+      assign_orientation
+    end
+
+    def transitive_orientation
+      assign_orientation(true)
+    end
+
+    private
+
+    def assign_orientation(return_graph = false)
+      transitive_orientation = Graphunk::DirectedGraph.new
+      transitive_orientation.add_vertices(*vertices)
+
+      unconsidered_edges = edges
+
+      transitive = true
+
+      until unconsidered_edges.empty?
+        considered_edge = unconsidered_edges.first
+        unconsidered_edges.delete(considered_edge)
+
+        transitive_orientation.add_edge(considered_edge.first, considered_edge.last)
+
+        explore = lambda do |edge|
+          if unconsidered_edges.include? edge
+            adjacent_edges(edge.first, edge.last).each do |adjacent_edge|
+              next if unconsidered_edges.include? adjacent_edge
+
+              shared_vertex = adjacent_edge.select { |vertex| edge.include? vertex }.first
+              unshared_edge_vertex = edge.reject { |vertex| adjacent_edge.include? vertex }.first
+              unshared_adjacent_edge_vertex = adjacent_edge.reject { |vertex| edge.include? vertex }.first
+
+              unless edge_exists?(unshared_edge_vertex, unshared_adjacent_edge_vertex)
+                if transitive_orientation.edge_exists?(shared_vertex, unshared_adjacent_edge_vertex)
+                  transitive = false if transitive_orientation.edge_exists?(unshared_edge_vertex, shared_vertex)
+                  transitive_orientation.add_edge(shared_vertex, unshared_edge_vertex) unless transitive_orientation.edge_exists?(shared_vertex, unshared_edge_vertex)
+                  unconsidered_edges.delete(order_vertices(shared_vertex, unshared_edge_vertex))
+                else
+                  transitive = false if transitive_orientation.edge_exists?(shared_vertex, unshared_edge_vertex)
+                  transitive_orientation.add_edge(unshared_edge_vertex, shared_vertex) unless transitive_orientation.edge_exists?(unshared_edge_vertex, shared_vertex)
+                  unconsidered_edges.delete(order_vertices(shared_vertex, unshared_edge_vertex))
+                end
+
+                adjacent_edges(edge.first, edge.last).each { |neighbor| explore.call neighbor }
+              end
+            end
+          end
+        end
+
+        adjacent_edges(considered_edge.first, considered_edge.last).each { |neighbor_edge| explore.call neighbor_edge }
+      end
+
+      if transitive && return_graph
+        transitive_orientation
+      else
+        transitive
+      end
+    end
+
   end
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: graphunk
 version: !ruby/object:Gem::Version
-  version: 0.5.1
+  version: 0.5.2
 platform: ruby
 authors:
 - Evan Hemsley
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2014-03-16 00:00:00.000000000 Z
+date: 2014-04-02 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rspec