hash_graph 0.1.0 → 0.2.0

data/README.rdoc

@@ -10,6 +10,11 @@ b in the Hash g, so all nodes can be identified by g.keys
 
 HashGraph::DirectedGraph also includes TSort for Tarjan's algorithm
 
+== Install
+
+  gem source --add http://gemcutter.org
+  gem install hash_graph
+
 == Note on Patches/Pull Requests
  
 * Fork the project.

data/VERSION

@@ -1 +1 @@
-0.1.0
+0.2.0

data/lib/hash_graph.rb

@@ -35,6 +35,23 @@ module HashGraph
       end
     end
 
+    # convert to an UndirectedGraph, with a proc which takes weights
+    # (a,b,weight_a_b,weight_b_a) as parameters [weights may be nil, indicating no edge], 
+    # and returns weight_a_b or nil for the undirected graph edge [ which will be the same
+    # as weight_b_a ]
+    def to_undirected_graph(&proc)
+      inject(UndirectedGraph.new()) do |ug,(a,targets)|
+        targets.each do |(b,weight_a_b)|
+          if !ug[a][b]
+            weight_b_a = self[b][a]
+            undw = proc.call(a,b,weight_a_b, weight_b_a)
+            ug[a][b]=undw if undw
+          end
+        end
+        ug
+      end
+    end
+
     alias tsort_each_node each_key
 
     def tsort_each_child(node,&block)

data/spec/hash_graph_spec.rb

@@ -1,4 +1,5 @@
 require File.expand_path(File.dirname(__FILE__) + '/spec_helper')
+require 'set'
 
 describe HashGraph do
   module HashGraph
@@ -27,6 +28,39 @@ describe HashGraph do
         h[:bar][:baz] = 5
         h.should == {:foo=>{:bar=>1}, :bar=>{:baz=>5}, :baz=>{}}
       end
+
+      describe "to_undirected_graph" do
+        it "should convert a directed graph with bi-directional edges to an undirected graph" do
+          h = DirectedGraph.new
+          h[:foo][:bar] = 1
+          h[:bar][:foo] = 3
+          h.to_undirected_graph do |a,b,wab,wba| 
+            [a,b].to_set.should == [:foo,:bar].to_set
+            [wab,wba].to_set.should == [1,3].to_set
+            wab+wba
+          end.should=={:foo=>{:bar=>4}, :bar=>{:foo=>4}}
+        end
+
+        it "should convert a directed graph with asymmetric edges to an undirected graph" do
+          h = DirectedGraph.new
+          h[:foo][:bar] = 1
+          h.to_undirected_graph do |a,b,wab,wba| 
+            [a,b].should == [:foo,:bar]
+            [wab,wba].should == [1,nil]
+            wab
+          end.should=={:foo=>{:bar=>1}, :bar=>{:foo=>1}}
+        end
+
+        it "should not create undirected edges if the proc returns nil" do
+          h = DirectedGraph.new
+          h[:foo][:bar] = 1
+          h.to_undirected_graph do |a,b,wab,wba| 
+            [a,b].should == [:foo,:bar]
+            [wab,wba].should == [1,nil]
+            nil
+          end.should=={}
+        end
+      end
     end
 
     describe UndirectedGraph do

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification 
 name: hash_graph
 version: !ruby/object:Gem::Version 
-  version: 0.1.0
+  version: 0.2.0
 platform: ruby
 authors: 
 - mccraig mccraig of the clan mccraig