directed_graph 0.6.0 → 0.6.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: aedb32953183318d27dea925e006475fd2617b96
-  data.tar.gz: c933b6d715687f372a3f7b15c386ff546b159f33
+  metadata.gz: 072f04bf6d9b527c8b6754ddc0ba6bcc7ce78be8
+  data.tar.gz: 525dcb15965f21d4021f8e231a153bebbe318cfa
 SHA512:
-  metadata.gz: 557088cc56ff7855be0bbc9cf3bd8e91bc0630cc9bb1a14d3be089fbddb477dcb7b51f81b5b2c84dc7ff2df400f6b1a19afc1f3eaea7d00fa6ad8094169e2f73
-  data.tar.gz: 06ef0c31d0dea4da5bdbfe449a3b3d84749f1680dd3df6bfa559aecd51f1e1b28931aad3130887fb357aaf44e9b068212f1c0418d8c63292d72690279259e2c9
+  metadata.gz: ae7c9473a9d90281a79c1fa9edba73922b17dc8c3a1bcc8d9d31981bae2d02bf586a1bb3ba38aaf30b87c8a5cf8e865aecda94c492d8a1f10fc965b90a4169a8
+  data.tar.gz: 2bd210fc46ecf1865d0176de90abcba0775a5352830662b5e0596beb275aaf9718b50817c3f64fffef773bb01c060e16787e3a29c7582a2f38ebdabfb881b8b7

data/README.md

@@ -53,6 +53,28 @@ The `@graph` object can be used to calculate the longest path between two vertic
 @graph.longest_path(@d, @a) # returns [] when the path doesn't exist
 ```
 
+The `@graph` object can be used to generate a graphml file
+
+```ruby
+require 'color-generator'
+
+generator = ColorGenerator.new saturation: 0.3, lightness: 0.75
+
+# Set the color and label of each vertex
+#
+@graph.vertices.each do |vertex|
+  color = generator.create_hex
+  label = vertex.name
+
+  vertex.data[:graphics]  = {:fill=>["##{color}"], :label=>[label], :group=>color}
+end
+
+# Generate a graphml file
+# Import this file into program like yEd to size nodes and layout graph
+File.open("output.graphml", "w+") { |f| f.write(@graph.to_graphml())}
+```
+
+
 ## Installation
 
 Add this line to your application's Gemfile:

data/example/example.rb

@@ -0,0 +1,58 @@
+require 'minitest/autorun'
+require 'color-generator'
+require 'directed_graph'  #This is an external gem
+
+include DirectedGraph
+
+class BugTest < Minitest::Test
+  def test_two()
+
+    # Create the Vertices
+    #
+    @root = Vertex.new(name: "root")
+    @a = Vertex.new(name: "a")
+    @b = Vertex.new(name: "b")
+    @c = Vertex.new(name: "c")
+    @d = Vertex.new(name: "d")
+    @e = Vertex.new(name: "e")
+
+    # Create the Edges
+    #
+    # The first argument is the origin_vertex
+    # and the second is the destination_vertex
+    @ra = Edge.new(origin_vertex: @root, destination_vertex: @a)
+    @ab = Edge.new(origin_vertex: @a, destination_vertex: @b)
+    @bc = Edge.new(origin_vertex: @b, destination_vertex: @c)
+    @bd = Edge.new(origin_vertex: @b, destination_vertex: @d)
+    @ae = Edge.new(origin_vertex: @a, destination_vertex: @e)
+    @de = Edge.new(origin_vertex: @d, destination_vertex: @e)
+
+    # Create the Graph
+    #
+    @edges = [@ra, @ab, @bc, @bd, @ae, @de]
+    @graph = Graph.new(@edges)
+
+    # Set the color of the vertexes 
+    #
+    @generator = ColorGenerator.new saturation: 0.3, lightness: 0.75
+
+    @graph.vertices.each do |vertex|
+      label = vertex.name
+      color = @generator.create_hex
+
+      vertex.data[:graphics]  = {:fill=>["##{color}"], :label=>[label], :group=>color}
+    end
+
+    # Generate a graphml file
+    # Import this file into program like yEd to size nodes and layout graph
+    #
+    filename = "example_graph"
+
+    txt = @graph.to_graphml()
+
+    File.open("#{filename}.graphml", "w+") { |f| f.write(txt)}
+  end
+end
+
+
+

data/lib/directed_graph.rb

@@ -1,10 +1,12 @@
 require 'simple-graph'
+require 'builder'
 
 require "directed_graph/version"
 require_relative "./directed_graph/job_runner.rb"
 require_relative "./directed_graph/vertex.rb"
 require_relative "./directed_graph/edge.rb"
 require_relative "./directed_graph/graph.rb"
+require_relative "./directed_graph/graphml.rb"
 
 module DirectedGraph
 end

data/lib/directed_graph/graphml.rb

@@ -0,0 +1,78 @@
+#require 'builder'
+
+module DirectedGraph
+  class Graph
+
+    # Generate a string key from an array of identifiers
+    def compute_key(external_identifier)
+      x = [external_identifier].flatten
+      x.map! {|xx| xx.to_s}
+      x.join("_")
+    end
+
+    # Return graph as graphml text
+    def to_graphml()
+      builder = Builder::XmlMarkup.new(:indent => 1)
+      builder.instruct! :xml, :version => "1.0"
+
+      graphml_attribs = {
+        "xmlns" => "http://graphml.graphdrawing.org/xmlns",
+        "xmlns:xsi" => "http://www.w3.org/2001/XMLSchema-instance",
+        "xmlns:y" => "http://www.yworks.com/xml/graphml",
+        "xmlns:yed" => "http://www.yworks.com/xml/yed/3",
+        "xsi:schemaLocation" => "http://graphml.graphdrawing.org/xmlns http://www.yworks.com/xml/schema/graphml/1.1/ygraphml.xsd",
+        :directed => "1",
+        :label => "test"
+      }
+
+      builder.graphml(graphml_attribs) do
+
+        # Define key id's at top of graphml file
+        builder.key({:for=>"node", :id=>"d3", "yfiles.type"=>"nodegraphics"})
+
+        # Build Graph 
+        #
+        builder.graph({:id=>"G"}) do
+
+          vertices.each do |vertex|
+
+            builder.node(:id => compute_key([vertex.name, vertex.object_id])) do
+
+              builder.data({:key=>"d3"}) do
+                builder.tag!("y:ShapeNode") do
+
+                  graphics = vertex.data.fetch(:graphics, {})
+                  graphics.fetch(:fill, []).each    {|f| builder.tag! "y:Fill",    {:color=>f, :transparent=>"false"}}
+                  graphics.fetch(:shape,[]).each    {|s| builder.tag! "y:Shape",   {:type=>s}}
+                  graphics.fetch(:geometry,[]).each {|s| builder.tag! "y:Geometry", s}
+                  graphics.fetch(:label,[]).each    {|l| builder.tag! "y:NodeLabel", l}
+                end
+              end
+            end
+          end
+
+          edges.each do |edge|
+            source = edge.origin_vertex
+            target = edge.destination_vertex
+
+            options = edge.data[:options]
+            label   = ""
+
+            builder.edge(
+              :source => s = compute_key([source.name, source.object_id]), 
+              :target => t = compute_key([target.name, target.object_id]), 
+              :id => compute_key([source.name, target.name, edge.object_id]),
+              :label => "#{label}"
+            ) do
+              #edge[:attributes].each_pair { |k, v| 
+              #  id_str = compute_key([k,:edge_attr])
+              #  builder.data(v.to_s, {:key=>@guid[id_str]})
+              #}
+            end
+          end
+        end
+      end
+      builder.target!
+    end
+  end
+end

data/lib/directed_graph/version.rb

@@ -1,3 +1,3 @@
 module DirectedGraph
-  VERSION = "0.6.0"
+  VERSION = "0.6.1"
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: directed_graph
 version: !ruby/object:Gem::Version
-  version: 0.6.0
+  version: 0.6.1
 platform: ruby
 authors:
 - MrPowers
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2016-01-05 00:00:00.000000000 Z
+date: 2017-09-01 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -98,10 +98,12 @@ files:
 - bin/console
 - bin/setup
 - directed_graph.gemspec
+- example/example.rb
 - example/simple_directed_graph.png
 - lib/directed_graph.rb
 - lib/directed_graph/edge.rb
 - lib/directed_graph/graph.rb
+- lib/directed_graph/graphml.rb
 - lib/directed_graph/job_runner.rb
 - lib/directed_graph/version.rb
 - lib/directed_graph/vertex.rb