directed_graph 0.4.0 → 0.5.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: f3a68ea4ee1b57dc00898a6fc2a7d22911aea8ff
-  data.tar.gz: cd9fe2d655d4672152a786f5204e97b9023af6cc
+  metadata.gz: edfa37763311b3a3d480890a4a5dc757abebad24
+  data.tar.gz: f0dfaaed0b132d944a4f0d8556907f2565f9dac7
 SHA512:
-  metadata.gz: 46e9b7620b61262d8dd27f81b922968e1151a552e635bfc97fd41a7bb196f22c47e2910bf24563d632032e2fb607eccb4449c4da2de76796898f8d0e0d96bf12
-  data.tar.gz: 6515c50de7baa3fb797389ac632d764ef6739d198b88c0be0d20657fd60e0e79dd09c8ee0300b3fd0301cc181b0f08e644f58c56e45e24b9c6310f8eb9ac4a18
+  metadata.gz: 9c5be553de3c4b3aeb99e7581c1cb054da42c69f2a992f1afab966f39a20a750c84c81acfaa441d1d4e49bcb2b64b2b51dfe5d58343b5bccbbfe35489c4b0980
+  data.tar.gz: f2b3dc7e1c1acb300a37411df2b372dae5aebbc753a01c440021009219843b3e11913ad6a5ef1e8b2ba28d32ff47a06c21a69bd009f53770498e3c723389a37e

data/lib/directed_graph.rb

@@ -5,6 +5,7 @@ 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/graph_builder.rb"
 
 module DirectedGraph
 end

data/lib/directed_graph/edge.rb

@@ -2,12 +2,13 @@ module DirectedGraph
 
   class Edge
 
-    attr_reader :origin_vertex, :destination_vertex, :value
+    attr_reader :origin_vertex, :destination_vertex
+    attr_accessor :data
 
     def initialize(args)
       @origin_vertex = args.fetch(:origin_vertex)
       @destination_vertex = args.fetch(:destination_vertex)
-      @value = args.fetch(:value, nil)
+      @data = args.fetch(:data, {})
     end
 
   end

data/lib/directed_graph/graph.rb

@@ -4,7 +4,7 @@ module DirectedGraph
 
     attr_reader :edges
 
-    def initialize(edges)
+    def initialize(edges = [])
       @edges = edges
     end
 
@@ -30,19 +30,19 @@ module DirectedGraph
       simple_graph.shortest_path(origin_vertex, destination_vertex)
     end
 
-    def longest_path(origin_vertex, destination_vertex, result = [])
-      return [destination_vertex] + result if origin_vertex == destination_vertex
+    def longest_path(origin_vertex_name, destination_vertex, result = [])
+      return [destination_vertex] + result if origin_vertex_name == destination_vertex.name
       parents(destination_vertex).map do |v|
-        longest_path(origin_vertex, v, [destination_vertex] + result)
+        longest_path(origin_vertex_name, v, [destination_vertex] + result)
       end.inject([]) {|m, arr| m = arr if arr.length > m.length; m}
     end
 
     def children(vertex)
-      edges.select {|e| e.origin_vertex == vertex}.map{|e| e.destination_vertex}
+      edges.select {|e| e.origin_vertex.name == vertex.name}.map{|e| e.destination_vertex}
     end
 
     def parents(vertex)
-      edges.select {|e| e.destination_vertex == vertex}.map{|e| e.origin_vertex}
+      edges.select {|e| e.destination_vertex.name == vertex.name}.map{|e| e.origin_vertex}
     end
 
     private

data/lib/directed_graph/version.rb

@@ -1,3 +1,3 @@
 module DirectedGraph
-  VERSION = "0.4.0"
+  VERSION = "0.5.0"
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: directed_graph
 version: !ruby/object:Gem::Version
-  version: 0.4.0
+  version: 0.5.0
 platform: ruby
 authors:
 - MrPowers
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2015-10-18 00:00:00.000000000 Z
+date: 2016-01-05 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler