RubyGems Navigation menu

gratr19 0.4.4.1

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.4.1 - March 28, 2012 (252 KB)
  2. 0.4.4 - March 28, 2012 (252 KB)

Authors:

  • Shawn Garbett, Ankur Sethi

Owners:

Da27d97199c2e567ff848bf70984d405

Sha 256 checksum:

cf15cec950ca65fa7f421ce93277a9e24a467bea17938402d1057d7e6de7bf5e

Total downloads 59,855

For this version 58,633

Required Ruby Version: None

Licenses:

N/A

Gemfile:
= Copy to clipboard Copied!

install:
= Copy to clipboard Copied!

Links: