6

I would like to see an example of a Dijkastra search algorithm for a graph built using Ruby's RGL (http://rgl.rubyforge.org/) or GRATR (http://rubyforge.org/projects/gratr/).

I know GRATR has Dijkastra support but I'm not really sure how to go about using it, any help would be appreciated.

Andres
  • 485
  • 1
  • 4
  • 10
  • his last answer was the correct one: "This is an example of dijkstra in GRATR http://gratr.rubyforge.org/svn/examples/graph_self.rb" – mentatkgs Aug 30 '11 at 20:11

1 Answers1

3

One of these should help:

http://snippets.dzone.com/posts/show/7331
http://snippets.dzone.com/posts/show/6100
http://github.com/dbrady/dijkstra

This is an example of dijkstra in GRATR
http://gratr.rubyforge.org/svn/examples/graph_self.rb

Kalyan Maddu
  • 4,123
  • 2
  • 21
  • 26