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:
=
Copy to clipboard
Copied!
instalar:
=
Versões:
- 0.0.1 - March 29, 2012 (9 KB)
Development Dependencies (1):
rspec
>= 0
Donos:
Autores:
-
Levente Bagi
SHA 256 checksum:
8e6867f0ad06465e56fa86fa5bf04912075e726b93d2fe12d236ec1cc896a4a8