ruby-graphviz_c 1.1.0

data/examples/sdlshapes/sdlshapes.dot

@@ -0,0 +1,78 @@
+digraph test
+{
+        sdl_task [shape=sdl_task, color=red, fillcolor=cyan, style=filled, peripheries=0];
+        sdl_task2 [shape=sdl_task, label="sdl_task", peripheries=0];
+        sdl_task -> sdl_task2;
+        sdl_input_from_right [shape=sdl_input_from_right, color=red, fillcolor=cyan, style=filled, peripheries=0];
+        sdl_input_from_right2 [shape=sdl_input_from_right, label="sdl_input_from_right    ", peripheries=0];
+        sdl_input_from_right -> sdl_input_from_right2;
+        sdl_input_from_left [shape=sdl_input_from_left, color=red, fillcolor=cyan, style=filled, peripheries=0];
+        sdl_input_from_left2 [shape=sdl_input_from_left, label="    sdl_input_from_left", peripheries=0];
+        sdl_input_from_left -> sdl_input_from_left2;
+        sdl_priority_input_from_right [shape=sdl_priority_input_from_right, color=red, fillcolor=cyan, style=filled, peripheries=0];
+        sdl_priority_input_from_right2 [shape=sdl_priority_input_from_right, label="sdl_priority_input_from_right     ", peripheries=0];
+        sdl_priority_input_from_right -> sdl_priority_input_from_right2;
+        sdl_priority_input_from_left [shape=sdl_priority_input_from_left, color=red, fillcolor=cyan, style=filled, peripheries=0];
+        sdl_priority_input_from_left2 [shape=sdl_priority_input_from_left, label="     sdl_priority_input_from_left", peripheries=0];
+        sdl_priority_input_from_left -> sdl_priority_input_from_left2;
+        sdl_start [shape=sdl_start, color=red, fillcolor=cyan, style=filled, peripheries=0];
+        sdl_start2 [shape=sdl_start, label="                ", peripheries=0];
+        sdl_start -> sdl_start2;
+        sdl_procedure_start [shape=sdl_procedure_start, color=red, fillcolor=cyan, style=filled, peripheries=0];
+        sdl_procedure_start2 [shape=sdl_procedure_start, label="                ", peripheries=0];
+        sdl_procedure_start -> sdl_procedure_start2;
+        sdl_state [shape=sdl_state, color=red, fillcolor=cyan, style=filled, peripheries=0];
+        sdl_state2 [shape=sdl_state, peripheries=0];
+        sdl_state -> sdl_state2;
+        sdl_output_to_right [shape=sdl_output_to_right, color=red, fillcolor=cyan, style=filled, peripheries=0];
+        sdl_output_to_right2 [shape=sdl_output_to_right, label="sdl_output_to_right  ", peripheries=0];
+        sdl_output_to_right -> sdl_output_to_right2;
+        sdl_output_to_left [shape=sdl_output_to_left, color=red, fillcolor=cyan, style=filled, peripheries=0];
+        sdl_output_to_left2 [shape=sdl_output_to_left, label="  sdl_output_to_left", peripheries=0];
+        sdl_output_to_left -> sdl_output_to_left2;
+        sdl_condition [shape=sdl_condition, color=red, fillcolor=cyan, style=filled, peripheries=0];
+        sdl_condition2 [shape=sdl_condition, label="  sdl_condition  ", peripheries=0];
+        sdl_condition -> sdl_condition2;
+        sdl_save [shape=sdl_save, color=red, fillcolor=cyan, style=filled, peripheries=0];
+        sdl_save2 [shape=sdl_save, label="  sdl_save  ", peripheries=0];
+        sdl_save -> sdl_save2;
+        sdl_stop [shape=sdl_stop, peripheries=0];
+        sdl_stop2 [shape=sdl_stop, label="", peripheries=0];
+        sdl_stop -> sdl_stop2 [arrowhead=none, headclip=false];
+        sdl_return [shape=sdl_return, color=red, fillcolor=cyan, style=filled, peripheries=0];
+        sdl_return2 [shape=sdl_return, label="", peripheries=0];
+        sdl_return -> sdl_return2;
+        sdl_create [shape=sdl_create, color=red, fillcolor=cyan, style=filled, peripheries=0];
+        sdl_create2 [shape=sdl_create, peripheries=0];
+        sdl_create -> sdl_create2;
+        sdl_call [shape=sdl_call, color=red, fillcolor=cyan, style=filled, peripheries=0];
+        sdl_call2 [shape=sdl_call, label="  sdl_call  ", peripheries=0];
+        sdl_call -> sdl_call2;
+        sdl_text [shape=sdl_text, color=red, fillcolor=cyan, style=filled, peripheries=0];
+        sdl_text2 [shape=sdl_text, peripheries=0];
+        sdl_text -> sdl_text2;
+        sdl_text_extension_from_left [shape=sdl_text_extension_from_left, color=red, fillcolor=cyan, style=filled, peripheries=0];
+        sdl_text_extension_from_left2 [shape=sdl_text_extension_from_left, peripheries=0];
+        sdl_text_extension_from_left -> sdl_text_extension_from_left2;
+        sdl_text_extension_from_right [shape=sdl_text_extension_from_right, color=red, fillcolor=cyan, style=filled, peripheries=0];
+        sdl_text_extension_from_right2 [shape=sdl_text_extension_from_right, peripheries=0];
+        sdl_text_extension_from_right -> sdl_text_extension_from_right2;
+        sdl_comment_from_left [shape=sdl_comment_from_left, color=red, fillcolor=cyan, style=filled, peripheries=0];
+        sdl_comment_from_left2 [shape=sdl_comment_from_left, style=dashed, peripheries=0];
+        sdl_comment_from_left -> sdl_comment_from_left2;
+        sdl_comment_from_right [shape=sdl_comment_from_right, color=red, fillcolor=cyan, style=filled, peripheries=0];
+        sdl_comment_from_right2 [shape=sdl_comment_from_right, style=dashed, peripheries=0];
+        sdl_comment_from_right -> sdl_comment_from_right2;
+        sdl_connector [shape=sdl_connector, color=red, fillcolor=cyan, style=filled, peripheries=0];
+        sdl_connector2 [shape=sdl_connector, peripheries=0];
+        sdl_connector -> sdl_connector2;
+        sdl_set [shape=sdl_set, color=red, fillcolor=cyan, style=filled, peripheries=0];
+        sdl_set2 [shape=sdl_set, label="    sdl_set2", peripheries=0];
+        sdl_set -> sdl_set2;
+        sdl_reset [shape=sdl_reset, color=red, fillcolor=cyan, style=filled, peripheries=0];
+        sdl_reset2 [shape=sdl_reset, label="    sdl_reset2", peripheries=0];
+        sdl_reset -> sdl_reset2;
+        sdl_export [shape=sdl_export, color=red, fillcolor=cyan, style=filled, peripheries=0];
+        sdl_export2 [shape=sdl_export, label="    sdl_export", peripheries=0];
+        sdl_export -> sdl_export2;
+}

data/examples/test.xml

@@ -0,0 +1,26 @@
+<inventory title="OmniCorp Store #45x10^3">
+  <section name="health">
+    <item upc="123456789" stock="12">
+      <name>Invisibility Cream</name>
+      <price>14.50</price>
+      <description>Makes you invisible</description>
+    </item>                                         
+    <item upc="445322344" stock="18">
+      <name>Levitation Salve</name>
+      <price>23.99</price>         
+      <description>Levitate yourself for up to 3 hours per application</description>
+    </item>
+  </section>
+  <section name="food">
+    <item upc="485672034" stock="653">
+      <name>Blork and Freen Instameal</name>
+      <price>4.95</price>                   
+      <description>A tasty meal in a tablet; just add water</description>
+    </item>
+    <item upc="132957764" stock="44">
+      <name>Grob winglets</name>
+      <price>3.56</price>       
+      <description>Tender winglets of Grob. Just add water</description>   
+    </item>   
+  </section>
+</inventory>

data/examples/theory/pert.rb

@@ -0,0 +1,47 @@
+$:.unshift( "../../lib" )
+require 'graphviz'
+require 'graphviz/theory'
+
+g = GraphViz.digraph( "G", :path => "/usr/local/bin", :use => "fdp" ) do |g|
+  g.node[:shape => "record"]
+
+  g.start[:label => "Start"]
+  g.task_1[:label => "Task #1 - Duration : 4d"]
+  g.task_2[:label => "Task #2 - Duration : 5.25d"]
+  g.task_3[:label => "Task #3 - Duration : 5.17d"]
+  g.task_4[:label => "Task #4 - Duration : 6.33d"]
+  g.task_5[:label => "Task #5 - Duration : 5.17d"]
+  g.task_6[:label => "Task #6 - Duration : 4.5d"]
+  g.task_7[:label => "Task #7 - Duration : 5.17d"]
+  g.finish[:label => "End"]
+
+  (g.start << g.task_1)[:weight => 0.0]
+  (g.start << g.task_2)[:weight => 0.0]
+  (g.task_1 << g.task_3)[:weight => 4.0]
+  (g.task_1 << g.task_4)[:weight => 4.0]
+  (g.task_2 << g.task_5)[:weight => 5.25]
+  (g.task_3 << g.task_5)[:weight => 5.17]
+  (g.task_4 << g.task_6)[:weight => 6.33]
+  (g.task_5 << g.task_7)[:weight => 5.17]
+  (g.task_6 << g.finish)[:weight => 4.5]
+  (g.task_7 << g.finish)[:weight => 5.17]
+end
+g.output( :png => "PERT.png" )
+
+t = GraphViz::Theory.new( g )
+
+print "Ranges : "
+rr = t.range
+p rr
+puts "Your graph contains circuits" if rr.include?(nil)
+
+puts "Critical path : "
+rrr = t.critical_path
+print "\tPath :"
+_ = ""
+rrr[:path].each do |i|
+  print _ + g.get_node_at_index(i-1).id
+  _ = " -> "
+end
+puts
+puts "\tDistance : #{rrr[:distance]}"

data/examples/theory/tests.rb

@@ -0,0 +1,87 @@
+$:.unshift( "../../lib" )
+require 'graphviz'
+require 'graphviz/theory'
+
+g = GraphViz.digraph( "G", :path => "/usr/local/bin" ) do |g|
+  g.a[:label => "1"]
+  g.b[:label => "2"]
+  g.c[:label => "3"]
+  g.d[:label => "4"]
+  g.e[:label => "5"]
+  g.f[:label => "6"]
+
+#   g.a << g.a
+  g.a << g.b
+  g.a << g.d
+  (g.a << g.f)[:weight => 6, :label => "6"]
+  g.b << g.c
+  g.b << g.d
+  g.b << g.e
+  g.c << g.d
+  (g.c << g.f)[:weight => 2, :label => "2"]
+  g.d << g.e
+#  g.e << g.c
+end
+g.output( :png => "matrix.png" )
+
+t = GraphViz::Theory.new( g )
+
+puts "Adjancy matrix : "
+puts t.adjancy_matrix
+# => [ 0 1 0 1 0 1]
+#    [ 0 0 1 1 1 0]
+#    [ 0 0 0 1 0 1]
+#    [ 0 0 0 0 1 0]
+#    [ 0 0 0 0 0 0]
+#    [ 0 0 0 0 0 0]
+
+puts "Symmetric ? #{t.symmetric?}"
+
+puts "Incidence matrix :"
+puts t.incidence_matrix
+# => [  1  1  1  0  0  0  0  0  0]
+#    [ -1  0  0  1  1  1  0  0  0]
+#    [  0  0  0 -1  0  0  1  1  0]
+#    [  0 -1  0  0 -1  0 -1  0  1]
+#    [  0  0  0  0  0 -1  0  0 -1]
+#    [  0  0 -1  0  0  0  0 -1  0]
+
+g.each_node do |name, node|
+  puts "Degree of node `#{name}' = #{t.degree(node)}"
+  print "neighbors : "; p t.neighbors(name).map{ |e| e.id } # = node.neighbors.map { |e| e.id }
+  print "incidents : "; p t.incidents(name).map{ |e| e.id } # = node.incidents.map { |e| e.id }
+end
+
+puts "Laplacian matrix :"
+puts t.laplacian_matrix
+# => [  3 -1  0 -1  0 -1]
+#    [  0  4 -1 -1 -1  0]
+#    [  0  0  3 -1  0 -1]
+#    [  0  0  0  4 -1  0]
+#    [  0  0  0  0  2  0]
+#    [  0  0  0  0  0  2]
+
+puts "Dijkstra between a and f"
+r = t.moore_dijkstra(g.a, g.f)
+if r.nil?
+  puts "No way !"
+else
+  print "\tPath : "; p r[:path]
+  puts "\tDistance : #{r[:distance]}"
+end
+# => Path : ["a", "b", "c", "f"]
+#    Distance : 4.0
+
+print "Ranges : "
+rr = t.range
+p rr
+puts "Your graph contains circuits" if rr.include?(nil)
+
+puts "Critical path : "
+rrr = t.critical_path
+print "\tPath "; p rrr[:path]
+puts "\tDistance : #{rrr[:distance]}"
+
+t.pagerank.each { |node, rank|
+   puts "Pagerank for node #{node.id} = #{rank}"
+}

data/lib/ext/gvpr/dot2ruby.g

@@ -0,0 +1,185 @@
+// Copyright (c) 2010 Gregoire Lejeune <gregoire.lejeune@free.fr>
+// 
+// This program is free software; you can redistribute it and/or modify
+// it under the terms of the GNU General Public License as published by
+// the Free Software Foundation; either version 2 of the License, or
+// (at your option) any later version.
+// 
+// This program is distributed in the hope that it will be useful,
+// but WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+// GNU General Public License for more details.
+// 
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, write to the Free Software
+// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
+//
+// Usage :
+//   gvpr -f dot2ruby.g [-a <output type>] <dot script>
+
+BEGIN {
+  int g_strict; int g_direct;
+  graph_t cluster;
+  node_t cnode;
+  edge_t cedge;
+  string attr; string attrv;
+  graph_t subgraph; graph_t pgraph;
+  graph_t ofgraph;
+  graph_t sub_graph;
+  graph_t tmp_g;
+
+  string xOut;
+  if( ARGC == 0 ) {
+    xOut = "_";
+  } else {
+    xOut = tolower(ARGV[0]);
+  }
+  
+  printf( "# This code was generated by dot2ruby.g\n\n" );
+
+  string rubyfy( string s ) {
+    string out;
+    out = tolower( s );
+    out = gsub( out, "[!a-zA-Z0-9_]", "_" );
+    return( out );
+  }
+
+  string stringify( string s ) {
+    string sout;
+    sout = gsub(s, "\"", "\\\"");
+    sout = gsub(sout, "@", "\\@");
+    sout = gsub(sout, "$", "\\$");
+    return( sout );
+  }
+
+  void load_sub_graph( graph_t p ) {
+    if(p == NULL) {
+      return;
+    }
+    sub_graph = fstsubg(p);
+    while( sub_graph != NULL ) {
+      pgraph = sub_graph.parent;
+      printf ( "  graph_%s = graph_%s.add_graph( \"%s\" )\n", rubyfy(sub_graph.name), rubyfy(pgraph.name), rubyfy(sub_graph.name) );
+
+      // ATTRS
+      attr = fstAttr(sub_graph, "G");
+      while( attr != "" ) {
+        attrv = aget( sub_graph, attr );
+        if( attrv != "" ) {
+          printf( "  graph_%s[:%s] = '%s'\n", rubyfy(sub_graph.name), attr, attrv );
+        }
+        attr = nxtAttr( sub_graph, "G", attr );
+      }
+      tmp_g = sub_graph;
+      load_sub_graph(sub_graph);
+      sub_graph = nxtsubg( tmp_g );
+
+    }
+  }
+
+  graph_t get_node_graph(node_t n, graph_t p) {
+    sub_graph = fstsubg(p);
+    while( sub_graph != NULL ) {
+      if( isSubnode( sub_graph, n) != 0 ) {
+        return get_node_graph(n, sub_graph);
+      }    
+      sub_graph = nxtsubg( sub_graph );
+    }
+    return p;
+  }
+
+  graph_t get_edge_graph(edge_t e, graph_t p) {
+    sub_graph = fstsubg(p);
+    while( sub_graph != NULL ) {
+      if( isSubedge( sub_graph, e) != 0 ) {      
+        return get_edge_graph(e, sub_graph);
+      }    
+      sub_graph = nxtsubg( sub_graph );
+    }
+    return p;
+  }
+
+
+}
+
+BEG_G {
+  printf( "require 'rubygems'\nrequire 'graphviz'\n");
+  // Directed 
+  g_direct = isDirect($);
+  if( g_direct == 0 ) {
+    printf( "graph_%s = GraphViz.graph( \"%s\"", rubyfy($.name), stringify($.name) );
+  } else {
+    printf( "graph_%s = GraphViz.digraph( \"%s\"", rubyfy($.name), stringify($.name) );
+  }
+  // Strict
+  g_strict = isStrict($);
+  if( g_strict != 0 ) {
+    printf( ", :strict => true" );
+  }
+  printf( " ) { |graph_%s|\n", rubyfy($.name) );
+  
+  // Attributs of G
+  attr = fstAttr($, "G");
+  while( attr != "" ) {
+    attrv = aget( $, attr );
+    if( attrv != "" ) {
+      printf( "  graph_%s[:%s] = '%s'\n", rubyfy($.name), attr, attrv );
+    }
+    attr = nxtAttr( $, "G", attr );
+  }
+  
+  load_sub_graph($);
+}
+
+N {
+  pgraph = $.root;
+  ofgraph = get_node_graph($, pgraph);
+  
+  printf( "  node_%s = graph_%s.add_nodes( \"%s\"", rubyfy($.name), rubyfy(ofgraph.name), stringify($.name) );
+
+  // Attributs of N
+    attr = fstAttr($G, "N");
+    while( attr != "" ) {
+      attrv = aget( $, attr );
+      if( attrv != "" ) {
+        printf( ", :%s => '%s'", attr, gsub( attrv, "'", "\\'" ) );
+      } else {
+        printf( ", :%s => ''", attr );
+      }
+      attr = nxtAttr( $G, "N", attr );
+    }
+
+    printf( " )\n");
+  }
+
+E {
+   pgraph = $.root;
+    ofgraph = get_edge_graph($, $.root);  
+
+  printf( "  graph_%s.add_edges( \"%s\", \"%s\"", rubyfy(ofgraph.name), stringify($.tail.name), stringify($.head.name) );
+
+// Attributs of E
+    attr = fstAttr($G, "E");
+    while( attr != "" ) {
+      attrv = aget( $, attr );
+      if( attrv != "" ) {
+        printf( ", :%s => '%s'", attr, gsub( attrv, "'", "\\'" ) );
+      } else {
+        printf( ", :%s => ''", attr );
+      }
+      attr = nxtAttr( $G, "E", attr );
+    }
+
+    printf( " )\n" );
+  }
+
+END_G {
+  printf( "}\n" );
+  if( xOut != "_" ) {
+    if( xOut == "-" ) {
+      printf( "@_graph_eval = graph_%s\n", rubyfy($.name) );
+    } else {
+  printf( "graph_%s.output( :%s => \"%s.%s\" )\n", rubyfy($.name), xOut, gsub($F, ".*/", ""), xOut );
+    }
+  }
+}

data/lib/graphviz/attrs.rb

@@ -0,0 +1,73 @@
+# Copyright (C) 2004 - 2012 Gregoire Lejeune <gregoire.lejeune@free.fr>
+#
+# This program is free software; you can redistribute it and/or modify
+# it under the terms of the GNU General Public License as published by
+# the Free Software Foundation; either version 2 of the License, or
+# (at your option) any later version.
+#
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+# GNU General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program; if not, write to the Free Software
+# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
+
+class AttributeException < RuntimeError
+end
+
+class GraphViz
+   class Attrs
+      attr_accessor :data
+
+      def initialize( gviz, name, attributes )
+         @name       = name
+         @attributes = attributes
+         @data       = Hash::new( )
+         @graphviz   = gviz
+      end
+
+      def each
+         @data.each do |k, v|
+            yield(k, v)
+         end
+      end
+
+      def to_h
+         @data.clone
+      end
+
+      def []( key )
+         if key.class == Hash
+            key.each do |k, v|
+               self[k] = v
+            end
+         else
+            @data[key.to_s]
+         end
+      end
+
+      def []=( key, value )
+         unless @attributes.keys.include?( key.to_s )
+            raise ArgumentError, "#{@name} attribute '#{key.to_s}' invalid"
+         end
+
+         if value.nil?
+            warn "Value for attribute `#{key}` can't be null"
+            return
+         end
+
+         begin
+            value = GraphViz::Types.const_get(@attributes[key.to_s]).new( value )
+         rescue => e
+            raise AttributeException, "Invalid value `#{value}` for attribute `#{key}` : #{e}"
+         end
+
+         if value
+           @data[key.to_s] = value
+           @graphviz.set_position( @name, key.to_s, @data[key.to_s] ) if @graphviz
+         end
+      end
+   end
+end