Ruby implementation for a few graph algorithms
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
bellman_ford
breadth_first_search fix typo Apr 15, 2017
connected_components
depth_first_search
dijkstra fix typo Nov 10, 2013
kosaraju_strong_components
kruskal remove 'soon' from kruskal's README Apr 15, 2013
topological_sort fix typo Nov 10, 2013
README.md

README.md

About

This is some of the code that I wrote while studying some famous graph algorithms. Although each directory has a README file whith a brief explanation, it's not my intend to fully explain any of these algorithms (there are much better sources out there), I just want to show a way they can be implemented in Ruby.

Contributing

If you want to add some interesting algorithm, fix some bug or just improve my code, fell free to open a pull request.

License

Use this code as you want. If you do use it, a reference would be appreciated, but not required.

Bitdeli Badge