routr 0.0.1

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.

Gemfile:
=

instalar:
=

Versiones:

0.0.1 March 29, 2012 (9 KB)

dependencias de Development (1):

rspec >= 0

Mostrar toda la cadena de dependencias

Propietarios:

Autores:

Levente Bagi

SHA 256 checksum:

=