RubyGems Navigation menu

rgl 0.4.0

RGL is a framework for graph data structures and algorithms. The design of the library is much influenced by the Boost Graph Library (BGL) which is written in C++ heavily using its template mechanism. RGL currently contains a core set of algorithm patterns: * Breadth First Search * Depth First 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 RGL currently include: * Topological Sort * Connected Components * Strongly Connected Components * Transitive Closure * Transitive Reduction * Graph Condensation * Search cycles (contributed by Shawn Garbett)

Versions:

  1. 0.4.0 - August 27, 2008 (72.5 KB)
  2. 0.3.1 - March 7, 2008 (69 KB)
  3. 0.3.0 - March 3, 2008 (69 KB)
  4. 0.2.3 - April 12, 2005 (67.5 KB)
  5. 0.2.2 - December 12, 2004 (65.5 KB)

Runtime Dependencies:

Authors:

  • Horst Duchene

Owners:

C5e056d4888f81842e966ff308c03416D4d28bd014f9e7324bad99dcc3b0d3903de4b03d1f7a076c1ee0544a505b80db0c7ff9d0d51cb8cb61e95044cf8b31427ba8c95ed9fee97f3fabd21f5c703170

Total downloads 60,197

For this version 54,670

Required Ruby Version: None

Licenses:

N/A

Gemfile:
gem 'rgl', '~> 0.4.0' = Copy to clipboard Copied!

install:
gem install rgl = Copy to clipboard Copied!

Links: