directed_graph 0.1.0 → 0.2.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 19be1d44522c23cea508cee9c7355fddbf94f2b7
-  data.tar.gz: 3113b3809f3bc9871456410a5a698403739ec631
+  metadata.gz: 4fc02a4eccc4014ced95f5e9733f9562bf5760f2
+  data.tar.gz: 4263efeaa3fe670468c03a5f8600b890b7cae100
 SHA512:
-  metadata.gz: cf44cda6bb1e05a6e40adf34ca14b58c2ca49f5d935b28ab10b8451365b1ca354c74e8c6b1d57f5aa2ea61ca8eddd6e8858c52e768707e19d305a3a7ad046fe3
-  data.tar.gz: 0a7178c9650e3d2908cb3b2185248c9cbbfbad2e0c88f75d695e8ed7111305aa6a8909e9f8fb3b4a745c6d11f31c8543bef187b83793a6da2be12c014e8fbe17
+  metadata.gz: 9637fa8cab2d210e408a27af1d9d2c7d28c3c7436dc2d3a6ab696d9f0efece71a4b4ef9b869214728556d8d0c8f3fe072f58e25fd83a30b22c15ecd520fabb87
+  data.tar.gz: 6b7791dfac072c0a2f3c305347f225cb89f52f9b4b65afda24af5c16c5e20c6919afc8aac084835a04b8f646542902004edb2140d1c9338bec2b5fc44bcd191a

data/README.md

@@ -27,6 +27,24 @@ The `@graph` object can be used to get a topological sorted array of the vertice
 @graph.sorted_vertices # ["root", "a", "b", "d", "e", "c"]
 ```
 
+Here is an [awesome blog post](https://endofline.wordpress.com/2010/12/22/ruby-standard-library-tsort/) on topological sorting in Ruby with the `TSort` module.
+
+The `@graph` object can also be used to calculate the shortest path between two vertices:
+
+```ruby
+@graph.shortest_path("root", "e")) # %w|root a e|
+@graph.shortest_path("root", "blah")) # nil because the "blah" vertex doesn't exist
+@graph.shortest_path("d", "a")) # nil because the graph is directed and can't be traversed in the wrong direction
+```
+
+The `@graph` object can be used to calculate the longest path between two vertices:
+
+```ruby
+@graph.longest_path("root", "e")) # %w|root a b d e|
+@graph.longest_path("a", "c")) # %w|a b c|
+@graph.longest_path("d", "a")) # returns [] when the path doesn't exist
+```
+
 ## Installation
 
 Add this line to your application's Gemfile:

data/directed_graph.gemspec

@@ -24,4 +24,5 @@ Gem::Specification.new do |spec|
   spec.add_development_dependency "rspec"
 
   spec.add_dependency 'pry'
+  spec.add_dependency 'simple-graph'
 end

data/lib/directed_graph/graph.rb

@@ -8,6 +8,12 @@ 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)}
@@ -26,14 +32,42 @@ module DirectedGraph
       JobRunner.sorted_vertices(vertices_and_children)
     end
 
+    def shortest_path(origin_vertex, destination_vertex)
+      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
+      parents(destination_vertex).map do |v|
+        longest_path(origin_vertex, v, [destination_vertex] + result)
+      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
 
+    def parents(vertex)
+      edges.select {|e| e.destination_vertex == vertex}.map{|e| e.origin_vertex}
+    end
+
     def vertices_and_children
       vertices.map {|v| [v, children(v)]}
     end
 
+    def simple_graph
+      graph = SimpleGraph::Graph.new
+      vertices.each do |v|
+        graph.add_vertex(v)
+      end
+      edges.each do |e|
+        graph.add_edge(e.origin_vertex, e.destination_vertex)
+      end
+      graph
+    end
+
   end
 
 end

data/lib/directed_graph/version.rb

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

data/lib/directed_graph.rb

@@ -1,3 +1,5 @@
+require 'simple-graph'
+
 require "directed_graph/version"
 require_relative "./directed_graph/job_runner.rb"
 require_relative "./directed_graph/edge.rb"

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: directed_graph
 version: !ruby/object:Gem::Version
-  version: 0.1.0
+  version: 0.2.0
 platform: ruby
 authors:
 - MrPowers
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2015-10-04 00:00:00.000000000 Z
+date: 2015-10-06 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -66,6 +66,20 @@ dependencies:
     - - ">="
       - !ruby/object:Gem::Version
         version: '0'
+- !ruby/object:Gem::Dependency
+  name: simple-graph
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
 description: Topological sorting, shortest path, and json exports for directed acyclic
   graphs
 email: