gratr19

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

Rubygem gratr19

Total Downloads
47622
Releases
2
Current Version
0.4.4.1
Released
2012-03-28 04:00:00 UTC
First Release
2012-03-28 04:00:00 UTC
Depends on following gems
Depending Gems
4

Github amalagaura/gratr

Watchers
3
Forks
1
Development activity
Inactive
Last commit
2012-03-28 16:33:51 UTC
First commit
Top contributors
Contributors
1

Resources

There are no resources yet, be the first to submit one!

Comments

There are no comments yet, be the first to write one!

Post a comment

Markdown supported
or
×

In order to continue, you must be signed in using your Github account.

If you're signing in using this account for the first time Github will ask for your permission to give access to your public user data to the Ruby Toolbox.

Although the Github Authorization page does not mention it, the request includes read-only access to your verified email address (user:email OAuth scope). This is neccessary so there's a way to notify you about comments, information about your accepted project edits and the like. You can review your notification settings on your account page once you're signed in.