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.