RubyGems Navigation menu

rgl 0.2.3

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

Gemfile:
= Copy to clipboard Copied!

install:
=

Versions:

  1. 0.6.6 - July 10, 2023 (67.5 KB)
  2. 0.6.5 - June 19, 2023 (67.5 KB)
  3. 0.6.4 - June 19, 2023 (67.5 KB)
  4. 0.6.3 - May 17, 2023 (67 KB)
  5. 0.6.2 - March 05, 2023 (66.5 KB)
  6. 0.2.3 - April 12, 2005* (67.5 KB)
Show all versions (23 total)

Runtime Dependencies (1):

stream >= 0.5

Owners:

Authors:

  • Horst Duchene

SHA 256 checksum:

111ee09f86cb018b5d702945931e486ae9fd0c04b61999436a050bd9de49253e

Total downloads 2,165,035

For this version 3,472

Licenses:

N/A

Required Ruby Version: > 0.0.0

Links: