| Short description: |
RGL Ruby Graph Library |
|---|
| Category: |
Library/Datastructure |
|---|
| Status: |
stable |
|---|
| Created: |
2002-11-07 21:38:37 GMT |
|---|
| Last update: |
2008-03-09 14:36:10 GMT |
| Owner: |
Horst Duchene
(Projects of this owner) |
|---|
| Homepage: |
http://rgl.rubyforge.org/rgl |
|---|
| Download: |
http://rubyforge.org/frs/?group_id=110
|
|---|
| License: |
Ruby's |
|---|
| Dependency: |
| Requires: |
stream/0.5
|
stream is now separated from RGL |
|
|---|
| Description: |
Ruby Graph Library (RGL)
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
|
|---|
| Versions: |
[0.3.1 (2008-03-09)]
[0.2.3 (2005-04-12)]
[0.2.2 (2004-12-12)]
[0.2.1 (-)]
|
|---|