Categories: None [Edit]
    gratr19
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
    Total
Ranking: 11,409 of 187,571
          Downloads: 220,611
        Daily
Ranking: 32,158 of 187,548
          Downloads: 12
        Downloads Trends
Ranking Trends
Num of Versions Trends
Popular Versions (Major)
Popular Versions (Major.Minor)
Depended by
| Rank | Downloads | Name | 
|---|---|---|
| 21,028 | 72,980 | gitolite | 
| 23,191 | 62,964 | jbox-gitolite | 
| 36,063 | 33,964 | columns_matcher | 
| 80,037 | 11,306 | gitolite-rugged | 
| 98,623 | 8,110 | gitolite-dtg | 
Depends on
| Rank | Downloads | Name | 
|---|
Owners
| # | Gravatar | Handle | 
|---|---|---|
| 1 | amala | 
 xmisao
xmisao