BETAmodules.com is in beta — open to partnerships & joint ventures.Build with us
modules.com
⌘K

routr

v0.0.1RubyGems· Ruby

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.

The verdict
Abandoned. Last published 14 years ago. No recent activity — look for a maintained alternative.
No recent activity — look for a maintained alternative.
Live from the RubyGems registry · derived rules, not AI
How it scores
MaintenanceAbandoned
PopularityNiche
SecurityClean
LicenseUnknown
DepsZero deps
Maintenance
Last published 14 years ago.
Popularity
6 downloads / week
Security
No known advisories for this version (OSV).
License
No license declared.
Dependencies
No runtime dependencies
Recent releases
  • 0.0.114 years ago
routr — 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. (Ruby / RubyGems) · Modules