Nested arrays can be used to create the digraph

aschoerk · Apr 15, 2011 · f16581b · f16581b
1 parent 3e0fdb8
commit f16581b
Show file tree

Hide file tree

Showing 2 changed files with 6 additions and 5 deletions.
diff --git a/lib/rgl/adjacency.rb b/lib/rgl/adjacency.rb
@@ -27,8 +27,13 @@ class DirectedAdjacencyGraph
     #
     #  RGL::DirectedAdjacencyGraph[1,2, 2,3, 2,4, 4,5].edges.to_a.to_s =>
     #    "(1-2)(2-3)(2-4)(4-5)"
+    #
+    #  This fork allows input to be of the form:
+    #    RGL::DirectedAdjacencyGraph[ [1,2], [2,3], [2,4], [4,5] ].edges_to_a.to_s
+    #      #=> "(1-2)(2-3)(2-4)(4-5)"
 
     def self.[] (*a)
+      a.flatten!
       result = new
       0.step(a.size-1, 2) { |i| result.add_edge(a[i], a[i+1]) }
       result

diff --git a/lib/rgl/forforf_rgl_adjacency.rb b/lib/rgl/forforf_rgl_adjacency.rb
@@ -51,11 +51,7 @@ def in_degree(v)
     rdg.out_degree(v)
   end
 
-  def out_degree(v)
-    self.adjacent_vertices(v).size
-  end
-
-  #Find nodes with #in_degree of 0
+  #Find vertices with in degree of 0
   #Although roots isn't strictly a digraph term (it's for trees)
   #it has the right connotation
   def roots