Implements Dijkstra's algorithm to find the shortest path in a graph. The cost of an edge can be more general than just a numeric value.

Required Ruby Version

None

Authors

Levente Bagi

Versions

  1. 0.0.1

    1. source

      1. 0.0.1 source March 29, 2012 (9 KB)

SHA 256 checksum