RubyGems Navigation menu

gratr 0.4.2

GRATR is a framework for graph data structures and algorithms. This library is a fork of RGL. This version utilizes Ruby blocks and duck typing to greatly simplfy the code. It also supports export to DOT format for display as graphics. GRATR currently contains a core set of algorithm patterns: * Breadth First Search * Depth First Search * A* Search * Floyd-Warshall * Best First Search * Djikstra's Algorithm * Lexicographic Search The algorithm patterns by themselves do not compute any meaningful quantities over graphs, they are merely building blocks for constructing graph algorithms. The graph algorithms in GRATR currently include: * Topological Sort * Strongly Connected Components * Transitive Closure * Rural Chinese Postman * Biconnected

Versions:

  1. 0.4.3 - January 4, 2007 (343 KB)
  2. 0.4.2 - January 1, 2007 (327 KB)

Authors:

  • Shawn Garbett

Owners:

400b2c1a72732cd01472da7ded58e677Ea6905beef63a84a75793f4f72cb8ff7

Sha 256 checksum:

8ab21fed5d34bfed9a469ab8f5c8f39162549932da63d1e318d7014131e603f0

Total downloads 5,935

For this version 1,857

Required Ruby Version: None

Licenses:

N/A

Gemfile:
= Copy to clipboard Copied!

install:
= Copy to clipboard Copied!

Links: