directed_graph 0.2.0 → 0.3.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 4fc02a4eccc4014ced95f5e9733f9562bf5760f2
-  data.tar.gz: 4263efeaa3fe670468c03a5f8600b890b7cae100
+  metadata.gz: 0adbde84d2c5293373788a5ce73f444fa41d3129
+  data.tar.gz: 691938d500c03589376637969b320ade01699fee
 SHA512:
-  metadata.gz: 9637fa8cab2d210e408a27af1d9d2c7d28c3c7436dc2d3a6ab696d9f0efece71a4b4ef9b869214728556d8d0c8f3fe072f58e25fd83a30b22c15ecd520fabb87
-  data.tar.gz: 6b7791dfac072c0a2f3c305347f225cb89f52f9b4b65afda24af5c16c5e20c6919afc8aac084835a04b8f646542902004edb2140d1c9338bec2b5fc44bcd191a
+  metadata.gz: 843edf49bae2d53557d2c749b1caaae3a523502f505d4306905dc43285b8f8a10047a39424617bb9edf9d97fe1e58456f9ebf1a11f6efa03ee62cebf9a68963f
+  data.tar.gz: df3e337f5f782951bab9974b6ade178ce10692fab50c2a0641a6efa1a38ee7a2f5f5859d116e88793a6c993a9ba9891a72cc78a709b6b3b48d1c9bcdf59dad65

data/README.md

@@ -11,12 +11,12 @@ The `Graph` class should be instantiated with an array of edges:
 ```ruby
 # The first argument is the origin_vertex
 # and the second is the destination_vertex
-@ra = Edge.new("root", "a")
-@ab = Edge.new("a", "b")
-@bc = Edge.new("b", "c")
-@bd = Edge.new("b", "d")
-@ae = Edge.new("a", "e")
-@de = Edge.new("d", "e")
+@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")
 @edges = [@ra, @ab, @bc, @bd, @ae, @de]
 @graph = Graph.new(@edges)
 ```

data/lib/directed_graph/edge.rb

@@ -4,10 +4,10 @@ module DirectedGraph
 
     attr_reader :origin_vertex, :destination_vertex, :value
 
-    def initialize(origin_vertex, destination_vertex, value = nil)
-      @origin_vertex = origin_vertex
-      @destination_vertex = destination_vertex
-      @value = value
+    def initialize(args)
+      @origin_vertex = args.fetch(:origin_vertex)
+      @destination_vertex = args.fetch(:destination_vertex)
+      @value = args.fetch(:value, nil)
     end
 
   end

data/lib/directed_graph/graph.rb

@@ -8,12 +8,6 @@ module DirectedGraph
       @edges = edges
     end
 
-    def vertices_longest_path_to_root(root_vertex)
-      vertices.map do |v|
-        [v, longest_path(root_vertex, v)]
-      end
-    end
-
     def vertices
       r = []
       edges.each {|e| r.push(e.origin_vertex, e.destination_vertex)}
@@ -43,8 +37,6 @@ module DirectedGraph
       end.inject([]) {|m, arr| m = arr if arr.length > m.length; m}
     end
 
-    private
-
     def children(vertex)
       edges.select {|e| e.origin_vertex == vertex}.map{|e| e.destination_vertex}
     end
@@ -53,6 +45,8 @@ module DirectedGraph
       edges.select {|e| e.destination_vertex == vertex}.map{|e| e.origin_vertex}
     end
 
+    private
+
     def vertices_and_children
       vertices.map {|v| [v, children(v)]}
     end

data/lib/directed_graph/version.rb

@@ -1,3 +1,3 @@
 module DirectedGraph
-  VERSION = "0.2.0"
+  VERSION = "0.3.0"
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: directed_graph
 version: !ruby/object:Gem::Version
-  version: 0.2.0
+  version: 0.3.0
 platform: ruby
 authors:
 - MrPowers
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2015-10-06 00:00:00.000000000 Z
+date: 2015-10-12 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler