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

Gemfile:
= 複製 已複製

安裝:
=

版本列表:

  1. 0.4.4.1 - March 28, 2012 (252.0 KB)
  2. 0.4.4 - March 28, 2012 (252.0 KB)

擁有者:

作者:

  • Shawn Garbett, Ankur Sethi

SHA 256 checksum:

cf15cec950ca65fa7f421ce93277a9e24a467bea17938402d1057d7e6de7bf5e

總下載次數 211,252

這個版本 207,882

License:

Ruby 版本需求:

相關連結: