hash_graph 0.3.0 → 0.4.0

data/VERSION

@@ -1 +1 @@
-0.3.0
+0.4.0

data/lib/hash_graph.rb

@@ -89,23 +89,24 @@ module HashGraph
     end
 
     # returns graph components
-    def components()
+    def components(&include_v)
       seen = Set.new
       comps = []
       keys.each do |vertex|
-        if !seen.include?(vertex)
+        if !seen.include?(vertex) && (!include_v || include_v.call(vertex))
           seen.add(vertex)
-          comps << explore_component(seen, Set.new([vertex]), vertex).to_a
+          comps << explore_component(seen, Set.new([vertex]), vertex, include_v).to_a
         end
       end
       comps
     end
 
-    def explore_component(seen, component, vertex)
+    def explore_component(seen, component, vertex, include_v)
       self[vertex].keys.each do |conn_v|
         explore_component(seen.add(conn_v), 
                           component.add(conn_v), 
-                          conn_v) if !seen.include?(conn_v)
+                          conn_v,
+                          include_v) if !seen.include?(conn_v) && (!include_v || include_v.call(conn_v))
       end
       component
     end

data/spec/hash_graph_spec.rb

@@ -90,6 +90,19 @@ describe HashGraph do
         h.components.map(&:to_set).to_set.should == [[:foo, :bar, :baz].to_set, 
                                                      [:boo, :woo].to_set].to_set
       end
+
+      it "should permit nodes to be filtered out when extracting components" do
+        h=UndirectedGraph.new
+        h[:foo][:bar]=1
+        h[:foo][:baz]=1
+        h[:boo][:woo]=1
+        h[:foo][:foofoo]=1
+        h[:foofoo][:boo]=1
+
+        h.components.size.should ==(1)
+        h.components{|v| v!=:foofoo}.map(&:to_set).to_set.should ==  [[:foo, :bar, :baz].to_set, 
+                                                                      [:boo, :woo].to_set].to_set
+      end
     end
 
   end

metadata

@@ -1,7 +1,12 @@
 --- !ruby/object:Gem::Specification 
 name: hash_graph
 version: !ruby/object:Gem::Version 
-  version: 0.3.0
+  prerelease: false
+  segments: 
+  - 0
+  - 4
+  - 0
+  version: 0.4.0
 platform: ruby
 authors: 
 - mccraig mccraig of the clan mccraig
@@ -9,39 +14,49 @@ autorequire:
 bindir: bin
 cert_chain: []
 
-date: 2010-02-23 00:00:00 +00:00
+date: 2010-03-03 00:00:00 +00:00
 default_executable: 
 dependencies: 
 - !ruby/object:Gem::Dependency 
   name: rspec
-  type: :development
-  version_requirement: 
-  version_requirements: !ruby/object:Gem::Requirement 
+  prerelease: false
+  requirement: &id001 !ruby/object:Gem::Requirement 
     requirements: 
     - - ">="
       - !ruby/object:Gem::Version 
+        segments: 
+        - 1
+        - 2
+        - 9
         version: 1.2.9
-    version: 
+  type: :development
+  version_requirements: *id001
 - !ruby/object:Gem::Dependency 
   name: yard
-  type: :development
-  version_requirement: 
-  version_requirements: !ruby/object:Gem::Requirement 
+  prerelease: false
+  requirement: &id002 !ruby/object:Gem::Requirement 
     requirements: 
     - - ">="
       - !ruby/object:Gem::Version 
+        segments: 
+        - 0
         version: "0"
-    version: 
+  type: :development
+  version_requirements: *id002
 - !ruby/object:Gem::Dependency 
   name: rr
-  type: :development
-  version_requirement: 
-  version_requirements: !ruby/object:Gem::Requirement 
+  prerelease: false
+  requirement: &id003 !ruby/object:Gem::Requirement 
     requirements: 
     - - ">="
       - !ruby/object:Gem::Version 
+        segments: 
+        - 0
+        - 10
+        - 5
         version: 0.10.5
-    version: 
+  type: :development
+  version_requirements: *id003
 description: Hash based directed and undirected graph implementations for Ruby
 email: craig@trampolinesystems.com
 executables: []
@@ -75,18 +90,20 @@ required_ruby_version: !ruby/object:Gem::Requirement
   requirements: 
   - - ">="
     - !ruby/object:Gem::Version 
+      segments: 
+      - 0
       version: "0"
-  version: 
 required_rubygems_version: !ruby/object:Gem::Requirement 
   requirements: 
   - - ">="
     - !ruby/object:Gem::Version 
+      segments: 
+      - 0
       version: "0"
-  version: 
 requirements: []
 
 rubyforge_project: 
-rubygems_version: 1.3.5
+rubygems_version: 1.3.6
 signing_key: 
 specification_version: 3
 summary: simple Hash based directed and undirected graph implementations for Ruby