plexus 0.5.8 → 0.5.10

data/lib/plexus/adjacency_graph.rb

@@ -208,6 +208,7 @@ module Plexus
     # @fixme
     def adjacent(x, options = {})
       options[:direction] ||= :out
+
       if !x.is_a?(Plexus::Arc) and (options[:direction] == :out || !directed?)
         if options[:type] == :edges
           i = -1

data/lib/plexus/directed_graph/algorithms.rb

@@ -68,26 +68,26 @@ module Plexus
         out_degree(v) - in_degree(v)
       end
 
-      def community(node, direction)
+      def community(node, direction, options = {:recursive => true})
         nodes, stack = {}, adjacent(node, :direction => direction)
         while n = stack.pop
           unless nodes[n.object_id] || node == n
             nodes[n.object_id] = n
-            stack += adjacent(n, :direction => direction)
+            stack += adjacent(n, :direction => direction) if options[:recursive]
           end
         end
         nodes.values
       end
 
-      def descendants(node)
+      def descendants(node, options = {:recursive => true})
         community(node, :out)
       end
 
-      def ancestors(node)
+      def ancestors(node, options = {:recursive => true})
         community(node, :in)
       end
 
-      def family(node)
+      def family(node, options = {:recursive => true})
         community(node, :all)
       end
     end

data/lib/plexus/undirected_graph/algorithms.rb

@@ -65,10 +65,11 @@ module Plexus
       def permutation?() comparability? and complement.comparability?; end
 
       # An undirected graph is defined to be split if there is a partition
-      # V = S + K of its vertex set into a stable set S and a complete set K.    
+      # V = S + K of its vertex set into a stable set S and a complete set K.
       def split?() triangulated? and complement.triangulated?; end
 
       private
+
       # Implementation taken from Golumbic's, "Algorithmic Graph Theory and
       # Perfect Graphs" pg. 99
       def triangulated_chromatic_number
@@ -85,6 +86,6 @@ module Plexus
         end; chi
       end
 
-    end # UndirectedGraphAlgorithms
-  end # UndirectedGraphBuilder
-end # Plexus
+    end
+  end
+end

data/lib/plexus/version.rb

@@ -1,6 +1,6 @@
 module Plexus
   MAJOR = 0
   MINOR = 5
-  PATCH = 8
+  PATCH = 10
   VERSION = [MAJOR, MINOR, PATCH].join('.')
 end

metadata

@@ -1,188 +1,184 @@
---- !ruby/object:Gem::Specification 
+--- !ruby/object:Gem::Specification
 name: plexus
-version: !ruby/object:Gem::Version 
+version: !ruby/object:Gem::Version
+  version: 0.5.10
   prerelease: 
-  version: 0.5.8
 platform: ruby
-authors: 
+authors:
 - Bruce Williams
 - Jean-Denis Vauguet <jd@vauguet.fr>
 autorequire: 
 bindir: bin
 cert_chain: []
-
-date: 2011-07-10 00:00:00 +02:00
-default_executable: 
-dependencies: 
-- !ruby/object:Gem::Dependency 
-  name: activesupport
-  prerelease: false
-  requirement: &id001 !ruby/object:Gem::Requirement 
+date: 2012-03-16 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: &17576720 !ruby/object:Gem::Requirement
     none: false
-    requirements: 
-    - - ">="
-      - !ruby/object:Gem::Version 
-        version: "0"
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
   type: :runtime
-  version_requirements: *id001
-- !ruby/object:Gem::Dependency 
-  name: facets
   prerelease: false
-  requirement: &id002 !ruby/object:Gem::Requirement 
+  version_requirements: *17576720
+- !ruby/object:Gem::Dependency
+  name: activesupport
+  requirement: &17576160 !ruby/object:Gem::Requirement
     none: false
-    requirements: 
-    - - ">="
-      - !ruby/object:Gem::Version 
-        version: "0"
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
   type: :runtime
-  version_requirements: *id002
-- !ruby/object:Gem::Dependency 
-  name: plexus
   prerelease: false
-  requirement: &id003 !ruby/object:Gem::Requirement 
+  version_requirements: *17576160
+- !ruby/object:Gem::Dependency
+  name: facets
+  requirement: &17575040 !ruby/object:Gem::Requirement
     none: false
-    requirements: 
-    - - ">="
-      - !ruby/object:Gem::Version 
-        version: "0"
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
   type: :runtime
-  version_requirements: *id003
-- !ruby/object:Gem::Dependency 
-  name: rspec
   prerelease: false
-  requirement: &id004 !ruby/object:Gem::Requirement 
+  version_requirements: *17575040
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: &17574340 !ruby/object:Gem::Requirement
     none: false
-    requirements: 
-    - - ">="
-      - !ruby/object:Gem::Version 
-        version: "0"
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
   type: :development
-  version_requirements: *id004
-- !ruby/object:Gem::Dependency 
-  name: yard
   prerelease: false
-  requirement: &id005 !ruby/object:Gem::Requirement 
+  version_requirements: *17574340
+- !ruby/object:Gem::Dependency
+  name: yard
+  requirement: &17573580 !ruby/object:Gem::Requirement
     none: false
-    requirements: 
-    - - ">="
-      - !ruby/object:Gem::Version 
-        version: "0"
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
   type: :development
-  version_requirements: *id005
-description: |
-  This library is based on GRATR and RGL.
-  
+  prerelease: false
+  version_requirements: *17573580
+description: ! 'This library is based on GRATR and RGL.
+
+
   Graph algorithms currently provided are:
-  
+
+
   * Topological Sort
+
   * Strongly Connected Components
+
   * Transitive Closure
+
   * Rural Chinese Postman
+
   * Biconnected
 
+'
 email: jd@vauguet.fr
 executables: []
-
 extensions: []
-
 extra_rdoc_files: []
-
-files: 
-- lib/plexus/biconnected.rb
+files:
+- lib/plexus.rb
+- lib/plexus/ext.rb
 - lib/plexus/arc.rb
+- lib/plexus/maximum_flow.rb
+- lib/plexus/biconnected.rb
 - lib/plexus/ruby_compatibility.rb
-- lib/plexus/dot.rb
-- lib/plexus/directed_graph.rb
-- lib/plexus/comparability.rb
-- lib/plexus/chinese_postman.rb
-- lib/plexus/classes/graph_classes.rb
-- lib/plexus/strong_components.rb
-- lib/plexus/support/support.rb
-- lib/plexus/common.rb
 - lib/plexus/search.rb
-- lib/plexus/arc_number.rb
-- lib/plexus/maximum_flow.rb
-- lib/plexus/ext.rb
-- lib/plexus/labels.rb
 - lib/plexus/undirected_graph.rb
 - lib/plexus/edge.rb
-- lib/plexus/directed_graph/distance.rb
-- lib/plexus/directed_graph/algorithms.rb
+- lib/plexus/support/support.rb
+- lib/plexus/labels.rb
 - lib/plexus/undirected_graph/algorithms.rb
+- lib/plexus/arc_number.rb
+- lib/plexus/directed_graph.rb
+- lib/plexus/chinese_postman.rb
+- lib/plexus/dot.rb
+- lib/plexus/graph.rb
+- lib/plexus/classes/graph_classes.rb
+- lib/plexus/directed_graph/algorithms.rb
+- lib/plexus/directed_graph/distance.rb
+- lib/plexus/comparability.rb
+- lib/plexus/strong_components.rb
 - lib/plexus/adjacency_graph.rb
+- lib/plexus/common.rb
 - lib/plexus/version.rb
-- lib/plexus/graph.rb
-- lib/plexus.rb
-- vendor/priority-queue/ext/priority_queue/CPriorityQueue/priority_queue.c
-- vendor/priority-queue/ext/priority_queue/CPriorityQueue/extconf.rb
 - vendor/priority-queue/README
 - vendor/priority-queue/Makefile
+- vendor/priority-queue/setup.rb
+- vendor/priority-queue/CHANGELOG
+- vendor/priority-queue/lib/priority_queue/ruby_priority_queue.rb
 - vendor/priority-queue/lib/priority_queue/c_priority_queue.rb
 - vendor/priority-queue/lib/priority_queue/poor_priority_queue.rb
-- vendor/priority-queue/lib/priority_queue/ruby_priority_queue.rb
 - vendor/priority-queue/lib/priority_queue.rb
 - vendor/priority-queue/benchmark/dijkstra.rb
-- vendor/priority-queue/CHANGELOG
+- vendor/priority-queue/doc/c-vs-rb.png
 - vendor/priority-queue/doc/compare_big.gp
-- vendor/priority-queue/doc/compare_small.png
 - vendor/priority-queue/doc/compare_small.gp
-- vendor/priority-queue/doc/results.csv
-- vendor/priority-queue/doc/c-vs-rb.png
+- vendor/priority-queue/doc/compare_small.png
 - vendor/priority-queue/doc/compare_big.png
+- vendor/priority-queue/doc/results.csv
 - vendor/priority-queue/priority_queue.so
+- vendor/priority-queue/ext/priority_queue/CPriorityQueue/extconf.rb
+- vendor/priority-queue/ext/priority_queue/CPriorityQueue/priority_queue.c
 - vendor/priority-queue/test/priority_queue_test.rb
-- vendor/priority-queue/setup.rb
 - vendor/priority-queue/compare_comments.rb
 - vendor/rdot.rb
-- spec/spec.opts
+- spec/undirected_graph_spec.rb
+- spec/community_spec.rb
+- spec/biconnected_spec.rb
+- spec/strong_components_spec.rb
+- spec/multi_edge_spec.rb
 - spec/edge_spec.rb
-- spec/inspection_spec.rb
-- spec/digraph_spec.rb
+- spec/complement_spec.rb
+- spec/digraph_distance_spec.rb
+- spec/properties_spec.rb
 - spec/spec_helper.rb
 - spec/search_spec.rb
-- spec/triangulated_spec.rb
-- spec/multi_edge_spec.rb
-- spec/dot_spec.rb
 - spec/neighborhood_spec.rb
-- spec/complement_spec.rb
-- spec/biconnected_spec.rb
-- spec/undirected_graph_spec.rb
+- spec/triangulated_spec.rb
+- spec/spec.opts
 - spec/chinese_postman_spec.rb
-- spec/strong_components_spec.rb
-- spec/community_spec.rb
-- spec/digraph_distance_spec.rb
-- spec/properties_spec.rb
+- spec/inspection_spec.rb
+- spec/dot_spec.rb
+- spec/digraph_spec.rb
 - Gemfile
 - LICENSE
 - Rakefile
 - README.md
-has_rdoc: true
 homepage: http://github.com/chikamichi/plexus
 licenses: []
-
 post_install_message: 
 rdoc_options: []
-
-require_paths: 
+require_paths:
 - lib
-required_ruby_version: !ruby/object:Gem::Requirement 
+required_ruby_version: !ruby/object:Gem::Requirement
   none: false
-  requirements: 
-  - - ">="
-    - !ruby/object:Gem::Version 
-      version: "0"
-required_rubygems_version: !ruby/object:Gem::Requirement 
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
   none: false
-  requirements: 
-  - - ">="
-    - !ruby/object:Gem::Version 
-      version: "0"
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
 requirements: []
-
 rubyforge_project: 
-rubygems_version: 1.6.1
+rubygems_version: 1.8.17
 signing_key: 
 specification_version: 3
 summary: A framework for graph data structures and algorithms.
 test_files: []
-