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:
=

installation:
=

Versions:

0.0.1 March 29, 2012 (9 ko)

Dépendances de Development (1):

rspec >= 0

Show all transitive dependencies

Propriétaires:

Auteurs:

Levente Bagi

Total de contrôle SHA 256:

=