RubyGems Navigation menu

rgl 0.3.1

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 * Search cycles (contributed by Shawn Garbett)

Versions:

  1. 0.5.10 - January 02, 2023 (65.5 KB)
  2. 0.5.9 - August 29, 2022 (63.5 KB)
  3. 0.5.8 - June 02, 2022 (63.5 KB)
  4. 0.5.7 - December 19, 2020 (63.5 KB)
  5. 0.5.6 - August 23, 2019 (62.5 KB)
  6. 0.3.1 - March 07, 2008* (69 KB)
Show all versions (16 total)

Runtime Dependencies (2):

rake > 0.0.0
stream >= 0.5

Owners:

Authors:

  • Horst Duchene

SHA 256 checksum:

5a396a4f6b0f7c38d62c6c2f6dca48ccaee286b99c3ae28a19fc8964735792cf

Total downloads 1,490,469

For this version 3,582

Gemfile:
= Copy to clipboard Copied!

install:
=

Licenses:

N/A

Required Ruby Version: > 0.0.0

Links: