hash_graph 0.2.0 → 0.3.0

data/VERSION

@@ -1 +1 @@
-0.2.0
+0.3.0

data/lib/hash_graph.rb

@@ -1,4 +1,5 @@
 require 'tsort'
+require 'set'
 
 module HashGraph
   # a simple directed graph representation for TSort,
@@ -86,5 +87,28 @@ module HashGraph
         UndirectedGraph::new_lower_hash(h,a_vertex)
       end
     end
+
+    # returns graph components
+    def components()
+      seen = Set.new
+      comps = []
+      keys.each do |vertex|
+        if !seen.include?(vertex)
+          seen.add(vertex)
+          comps << explore_component(seen, Set.new([vertex]), vertex).to_a
+        end
+      end
+      comps
+    end
+
+    def explore_component(seen, component, vertex)
+      self[vertex].keys.each do |conn_v|
+        explore_component(seen.add(conn_v), 
+                          component.add(conn_v), 
+                          conn_v) if !seen.include?(conn_v)
+      end
+      component
+    end
+      
   end
 end

data/spec/hash_graph_spec.rb

@@ -81,6 +81,15 @@ describe HashGraph do
         h[:foo][:bar]=1
         h.should == {:foo=>{:bar=>1}, :bar=>{:foo=>1}}
       end
+
+      it "should extract components from an UndirectedGraph" do
+        h=UndirectedGraph.new
+        h[:foo][:bar]=1
+        h[:foo][:baz]=1
+        h[:boo][:woo]=1
+        h.components.map(&:to_set).to_set.should == [[:foo, :bar, :baz].to_set, 
+                                                     [:boo, :woo].to_set].to_set
+      end
     end
 
   end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification 
 name: hash_graph
 version: !ruby/object:Gem::Version 
-  version: 0.2.0
+  version: 0.3.0
 platform: ruby
 authors: 
 - mccraig mccraig of the clan mccraig
@@ -9,7 +9,7 @@ autorequire:
 bindir: bin
 cert_chain: []
 
-date: 2010-02-19 00:00:00 +00:00
+date: 2010-02-23 00:00:00 +00:00
 default_executable: 
 dependencies: 
 - !ruby/object:Gem::Dependency