rgl 0.4.0 → 0.5.0

data/examples/canvas.rb

@@ -1,7 +1,7 @@
 # From c.l.r SNIP IT: bond TkCanvas with RubyGraphLibrary
 # author: Phlip (see also
-# http://www.rubygarden.org/ruby?RubyAlgorithmPackage/TkCanvasSample) 
-# 
+# http://www.rubygarden.org/ruby?RubyAlgorithmPackage/TkCanvasSample)
+#
 # put a GraphViz graph into a TkCanvas, and make nodes
 # selectable. Illustrates a bug in GraphViz
 
@@ -19,83 +19,82 @@ puts 'Displaying ' + filename
 # ruby canvas.rb north/g.14.9.graphml &
 
 File.open(filename) { |file|
-  graph = DirectedAdjacencyGraph.from_graphxml(file)      
+  graph = DirectedAdjacencyGraph.from_graphxml(file)
   graph.write_to_graphic_file('gif', filename)
   graph.write_to_graphic_file('plain', filename)
-  root = TkRoot.new{title "Ex1"}
-  
-  canvas = TkCanvas.new(root)  {
-	width  400
-	height 600
+  root = TkRoot.new { title "Ex1" }
+
+  canvas = TkCanvas.new(root) {
+    width 400
+    height 600
   }
   canvas.pack()
   ovals = []
 
   TkcImage.new(canvas, 0, 0) {
-	anchor 'nw'
-	
-	image TkPhotoImage.new() {
-	  file filename + '.gif'
-	}
+    anchor 'nw'
+
+    image TkPhotoImage.new() {
+      file filename + '.gif'
+    }
   }
 
   #  read the 'plain' file, and for each node put an invisible
   #  oval over its image
-  
-  File.open(filename + '.plain')  {  |f|
-	graphLine = f.readline()
-	graphStats = graphLine.split()
-	graphHeight = graphStats[3].to_f()
-	nodeLine = f.readline()
-	fields = nodeLine.split()
-	
-	while fields[0] == 'node' 
-	  namer = fields[1]
-
-	  #  the following crud is because GraphViz has no system to 
-	  #  emit a "plain" format in pixels that exactly match the
-	  #  locations of objects in dot's raster output
-
-	  #  furtherless, the current GraphViz seems to be centering
-	  #  the raster output but not the 'plain' output. Hence on
-	  #  g.10.8.graphml the X fudge factor must be 45. >sigh<
-	  
-	  #  YMMV, based on your system's opinion of the size of an inch
-
-	  exx  = fields[2].to_f * 96 - 20 # 45
-	  why  = (graphHeight - fields[3].to_f()) * 96 - 20
-	  widt = fields[4].to_f() * 90
-	  hite = fields[5].to_f() * 90
-	  
-	  ov = TkcOval.new(canvas, exx, why, 
-					   exx + widt, why + hite)  {
-		state 'hidden'
-		width 4
-		outline 'green'
-		tags namer
-	  }
-	  ovals.push(ov)
-	  nodeLine = f.readline()
-	  fields = nodeLine.split()
-	end
+
+  File.open(filename + '.plain') { |f|
+    graphLine   = f.readline()
+    graphStats  = graphLine.split()
+    graphHeight = graphStats[3].to_f()
+    nodeLine    = f.readline()
+    fields      = nodeLine.split()
+
+    while fields[0] == 'node'
+      namer = fields[1]
+
+      #  the following crud is because GraphViz has no system to
+      #  emit a "plain" format in pixels that exactly match the
+      #  locations of objects in dot's raster output
+
+      #  furtherless, the current GraphViz seems to be centering
+      #  the raster output but not the 'plain' output. Hence on
+      #  g.10.8.graphml the X fudge factor must be 45. >sigh<
+
+      #  YMMV, based on your system's opinion of the size of an inch
+
+      exx  = fields[2].to_f * 96 - 20 # 45
+      why  = (graphHeight - fields[3].to_f) * 96 - 20
+      widt = fields[4].to_f() * 90
+      hite = fields[5].to_f() * 90
+
+      ov = TkcOval.new(canvas, exx, why, exx + widt, why + hite) {
+        state 'hidden'
+        width 4
+        outline 'green'
+        tags namer
+      }
+      ovals.push(ov)
+      nodeLine = f.readline()
+      fields   = nodeLine.split()
+    end
   }
   lastOval = ovals[0]
 
   #  at click time, search for an oval in range and display it
-  
-  canvas.bind('Button-1')  do |event|
-	x,y = canvas.canvasx(event.x), canvas.canvasy(event.y)
-	
-	ovals.each { |r|
-	  x1,y1,x2,y2 = r.coords()
-	  
-	  if x >= x1 and x <= x2 and y >= y1 and y <= y2 then
-		lastOval.configure('state' => 'hidden')
-		lastOval = r
-		lastOval.configure('state' => 'normal')
-		break
-	  end
-	}
+
+  canvas.bind('Button-1') do |event|
+    x, y = canvas.canvasx(event.x), canvas.canvasy(event.y)
+
+    ovals.each { |r|
+      x1, y1, x2, y2 = r.coords()
+
+      if x >= x1 and x <= x2 and y >= y1 and y <= y2
+        lastOval.configure('state' => 'hidden')
+        lastOval = r
+        lastOval.configure('state' => 'normal')
+        break
+      end
+    }
   end
 
   Tk.mainloop

data/examples/examples.rb

@@ -4,12 +4,12 @@ require 'rgl/adjacency'
 require 'rgl/implicit'
 
 # partite 8, 5
-def partite(n,m)
+def partite(n, m)
   result = RGL::DirectedAdjacencyGraph.new
   1.upto(n) { |i|
-	1.upto(m) { |j|
-		result.add_edge('a'+i.to_s,'b'+j.to_s)
-	}
+    1.upto(m) { |j|
+      result.add_edge('a' + i.to_s, 'b' + j.to_s)
+    }
   }
   result
 end
@@ -18,8 +18,8 @@ end
 def modulo (n, m)
   result = RGL::AdjacencyGraph.new
   1.upto(n) { |x|
-    1.upto(n) {|y|
-      result.add_edge x,y if x != y && x%m == y%m }
+    1.upto(n) { |y|
+      result.add_edge x, y if x != y && x % m == y % m }
   }
   result
 end
@@ -27,9 +27,9 @@ end
 # Cyclic graph with _n_ vertices
 def cycle (n)
   RGL::ImplicitGraph.new { |g|
-	g.vertex_iterator { |b| 0.upto(n-1,&b) }
-	g.adjacent_iterator { |x, b| b.call((x+1)%n) }
-	g.directed = true
+    g.vertex_iterator { |b| 0.upto(n - 1, &b) }
+    g.adjacent_iterator { |x, b| b.call((x + 1) % n) }
+    g.directed = true
   }
 end
 
@@ -37,40 +37,40 @@ end
 def complete (n)
   set = n.integer? ? (1..n) : n
   RGL::ImplicitGraph.new { |g|
-	g.vertex_iterator { |b| set.each(&b) }
-	g.adjacent_iterator { |x, b|
-	  set.each { |y| b.call(y) unless x == y }
-	}
+    g.vertex_iterator { |b| set.each(&b) }
+    g.adjacent_iterator { |x, b|
+      set.each { |y| b.call(y) unless x == y }
+    }
   }
 end
 
 # Directed graph of ruby modules. Edges are defined by the method _ancestors_
 def module_graph
   RGL::ImplicitGraph.new { |g|
-	g.vertex_iterator { |b|
-	  ObjectSpace.each_object(Module, &b) 
-	}
-	g.adjacent_iterator { |x, b|
-	  x.ancestors.each { |y|
-		b.call(y) unless x == y || y == Kernel || y == Object
-	  }
-	}
-	g.directed = true
+    g.vertex_iterator { |b|
+      ObjectSpace.each_object(Module, &b)
+    }
+    g.adjacent_iterator { |x, b|
+      x.ancestors.each { |y|
+        b.call(y) unless x == y || y == Kernel || y == Object
+      }
+    }
+    g.directed = true
   }
 end
 
 # Shows graph of divisors of all integers from 2 to _n_.
 def divisors(n)
   RGL::ImplicitGraph.new { |g|
-	g.vertex_iterator { |b| 2.upto(n,&b) }
-	g.adjacent_iterator { |x, b|
-		n.downto(x+1) { |y| b.call(y) if y % x == 0 }
-	}
-	g.directed = true
+    g.vertex_iterator { |b| 2.upto(n, &b) }
+    g.adjacent_iterator { |x, b|
+      n.downto(x + 1) { |y| b.call(y) if y % x == 0 }
+    }
+    g.directed = true
   }
 end
 
-def bfs_example(g=cycle(5), start=g.detect {|x| true})
+def bfs_example(g = cycle(5), start = g.detect { |x| true })
   require 'rgl/traversal'
 
   g.bfs_search_tree_from(start)
@@ -81,15 +81,15 @@ def graph_from_dotfile (file)
   g = RGL::AdjacencyGraph.new
   pattern = /\s*([^\"]+)[\"\s]*--[\"\s]*([^\"\[\;]+)/ # ugly but works
   IO.foreach(file) { |line|
-	case line
-	when /^digraph/
-	  g = RGL::DirectedAdjacencyGraph.new
-	  pattern = /\s*([^\"]+)[\"\s]*->[\"\s]*([^\"\[\;]+)/
-	when pattern
-	  g.add_edge $1,$2
-	else
-	  nil
-	end
+    case line
+      when /^digraph/
+        g = RGL::DirectedAdjacencyGraph.new
+        pattern = /\s*([^\"]+)[\"\s]*->[\"\s]*([^\"\[\;]+)/
+      when pattern
+        g.add_edge $1, $2
+      else
+        nil
+    end
   }
   g
 end
@@ -99,15 +99,15 @@ end
 if $0 == __FILE__
   require 'rgl/dot'
 
-  dg = RGL::DirectedAdjacencyGraph[1,2 ,2,3 ,2,4, 4,5, 6,4, 1,6]
+  dg = RGL::DirectedAdjacencyGraph[1,2, 2,3, 2,4, 4,5, 6,4, 1,6]
   dg.dotty
   dg.write_to_graphic_file
-  bfs_example(dg,1).dotty
-  bfs_example(graph_from_dotfile('dot/unix.dot'), 'Interdata').dotty({'label'=>'Interdata Nachfolger', 'fontsize' => 12})
+  bfs_example(dg, 1).dotty
+  bfs_example(graph_from_dotfile('dot/unix.dot'), 'Interdata').dotty({ 'label' => 'Interdata Nachfolger', 'fontsize' => 12 })
 
   g = module_graph
-  tree = bfs_example(module_graph,RGL::AdjacencyGraph)
-  g = g.vertices_filtered_by {|v| tree.has_vertex? v}
+  tree = bfs_example(module_graph, RGL::AdjacencyGraph)
+  g = g.vertices_filtered_by { |v| tree.has_vertex? v }
   g.write_to_graphic_file
   g.dotty
 end

data/examples/graph.dot

@@ -0,0 +1,46 @@
+subgraph RGL__AdjacencyGraph {
+    0 [
+        fontsize = 8,
+        label = 0
+    ]
+
+    1 [
+        fontsize = 8,
+        label = 1
+    ]
+
+    2 [
+        fontsize = 8,
+        label = 2
+    ]
+
+    3 [
+        fontsize = 8,
+        label = 3
+    ]
+
+    4 [
+        fontsize = 8,
+        label = 4
+    ]
+
+    0 -- 1 [
+        fontsize = 8
+    ]
+
+    0 -- 4 [
+        fontsize = 8
+    ]
+
+    1 -- 2 [
+        fontsize = 8
+    ]
+
+    2 -- 3 [
+        fontsize = 8
+    ]
+
+    3 -- 4 [
+        fontsize = 8
+    ]
+}

data/examples/{insel-der-tausend-gefahren.rb → insel_der_tausend_gefahren.rb}

@@ -1,7 +1,6 @@
 # Die Insel der 1000 Gefahren
 # http://www.amazon.de/1000-Gefahren-Die-Insel/dp/3473520225/ref=pd_sim_b?ie=UTF8&qid=1203279845&sr=8-3
 
-require 'rubygems' rescue nil
 require 'rgl/adjacency'
 require 'rgl/implicit'
 require 'rgl/dot'
@@ -18,16 +17,16 @@ g = RGL::DirectedAdjacencyGraph[
 
   11, 15,
   11, 16,
- 
+
   12, 17,
-  12, 18, 
+  12, 18,
 
-  13, 19, 
+  13, 19,
   13, 20,
 
   14, 21,
   14, 22,
- 
+
   15, 23,
   15, 24,
 
@@ -38,12 +37,12 @@ g = RGL::DirectedAdjacencyGraph[
   17, 28,
 
   18, 29,
-  18, 30, 
+  18, 30,
 
   18, 31,
   18, 32,
 
-  19, 31, 
+  19, 31,
   19, 32,
 
   20, 33,
@@ -58,7 +57,7 @@ g = RGL::DirectedAdjacencyGraph[
   23, 39,
   23, 40,
 
-  24, 41, 
+  24, 41,
   24, 42,
 
   25, 43,
@@ -71,29 +70,29 @@ g = RGL::DirectedAdjacencyGraph[
   27, 48,
 
   28, 49,
-  28, 50, 
+  28, 50,
 
   29, 51,
-  29, 52,  
+  29, 52,
 
   30, 53,
   30, 54,
-  
+
   31, 55,
-  31, 56, 
-  
+  31, 56,
+
   32, 57,
   32, 58,
 
   33, 59,
   33, 60,
- 
+
   34, 61,
   34, 62,
 
   35, 63,
   35, 64,
-#
+
   36, 65,
   36, 66,
 
@@ -135,9 +134,9 @@ g = RGL::DirectedAdjacencyGraph[
   53, 91,
 
   55, 93,
-  55, 94, 
+  55, 94,
+
 
-  
   57,  92,
 
 
@@ -155,7 +154,7 @@ g = RGL::DirectedAdjacencyGraph[
   61, 103,
 
   62, 104,
-  62, 105, 
+  62, 105,
 
   64, 88,
 
@@ -168,7 +167,7 @@ g = RGL::DirectedAdjacencyGraph[
   67, 109,
 
   75, 9,
-  
+
   78, 26,
 
   86, 30,