dijkstra 0.0.1

data/lib/dijkstra.rb

@@ -0,0 +1,163 @@
+class Dijkstra
+
+      #constructor of the class 
+      def initialize(startpoint, endpoint, matrix_of_road)
+
+         #start node
+         @start = startpoint
+          
+         #end node
+         @end = endpoint
+
+         @path = []
+ 
+         @PInfinit = 88
+
+         readAndInit( matrix_of_road )
+
+         #Dijkstra's algorithm in action and good luck
+         dijkstra()
+         
+      end  
+
+      # This method determines the minimum cost of the shortest path
+      def getCost()
+          @R[@end] 
+      end
+
+      # get the shortest path
+      def getShortestPath()
+          ROAD(@end)
+          @path
+      end
+
+      def ROAD(node) 
+          if @F[node] != 0
+             ROAD(@F[node])
+          end 
+
+          @path.push(node)
+      end
+
+      def dijkstra()
+  
+          start = @start
+          min = @PInfinit
+          posMin = @PInfinit
+
+          (1..@nodes-1).each do |i|
+              @R[i] = @road[start][i]
+              if i != start 
+                 if @R[i] < @PInfinit
+                    @F[i] = start 
+                 end
+              end
+          end
+  
+          #for debug 
+          #print @R    
+  
+          @S[start] = 1
+
+          #for debug
+          #print @S
+
+          (1..@nodes-2).each do |d|
+               
+              min = @PInfinit
+
+              (1..@nodes-1).each do |i|
+                  if @S[i] == 0
+                     if @R[i] < min
+                         min = @R[i]
+                         posMin = i
+                     end
+                  end  
+              end     
+
+              @S[posMin] = 1  
+
+              (1..@nodes-1).each do|j|
+                  if @S[j] == 0
+                           if @R[j] > @R[posMin] + @road[posMin][j] 
+                              @R[j] = @R[posMin] + @road[posMin][j]
+                              @F[j] = posMin
+                           end 
+                  end
+              end  
+               
+          end 
+
+      end 
+
+      def readAndInit( arr )
+        
+          @nodes = arr[0][0]+1
+
+          n = arr.size()-1
+
+          @road = Array.new(@nodes) { Array.new(@nodes) }
+          @R = Array.new(@nodes)
+          @S = Array.new(@nodes)
+          @F = Array.new(@nodes)
+
+          (0..@nodes-1).each do |i|
+              @R[i] = 0 
+          end
+
+          (0..@nodes-1).each do |i|
+              @S[i] = 0 
+          end
+
+          (0..@nodes-1).each do |i|
+              @F[i] = 0 
+          end
+
+          (0..@nodes-1).each do |i|
+              (0..@nodes-1).each do |j|
+                  if i == j
+                     @road[i][j] = 0 
+                  else
+                     @road[i][j] = @PInfinit
+                  end 
+              end  
+           end 
+
+           (1..n).each do |i|
+                  x = arr[i][0]
+                  y = arr[i][1]
+                  c = arr[i][2]
+                  @road[x][y] = c
+           end 
+      end
+
+      def writeToFile(filename)
+
+          f = File.open(filename,"w")
+          out = "Cost -> " + @R[@end].to_s + "\nShortest Path -> " + @path.to_s
+          f.write(out) 
+
+          f.close()   
+      end
+end
+
+r = [[5],
+     [1,2,1],
+     [1,3,9],
+     [1,5,3],
+     [2,4,3],
+     [2,3,7],
+     [4,3,2],
+     [4,1,1],
+     [5,2,4],
+     [5,4,2]]
+
+start_point = 1
+end_point = 3
+
+ob = Dijkstra.new(start_point, end_point, r)
+
+print "Cost = ", ob.getCost(), "\n"
+print "Shortest Path = ", ob.getShortestPath()
+
+ob.writeToFile("shortestpath.out")

metadata

@@ -0,0 +1,46 @@
+--- !ruby/object:Gem::Specification
+name: dijkstra
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+  prerelease: 
+platform: ruby
+authors:
+- Adrian Statescu
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2014-09-12 00:00:00.000000000 Z
+dependencies: []
+description: Dijkstra's Algorithm For Shortest Path Directed Graph
+email: mergesortv@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/dijkstra.rb
+homepage: http://github.com/thinkphp/dijkstra.gem
+licenses:
+- MIT
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 1.8.24
+signing_key: 
+specification_version: 3
+summary: Dijkstra!
+test_files: []