simple Hash-based directed and undirected graph implementations for Ruby
Ruby
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
lib
spec
.document
.gitignore
LICENSE
README.rdoc
Rakefile
VERSION

README.rdoc

hash_graph

HashGraph::DirectedGraph and HashGraph::UndirectedGraph are simple implementations of a directed an undirected graph respectively, based on Hash

HashGraph::UndirectedGraph ensures that g[b]==g[a]

HashGraph::DirectedGraph ensures that for every edge g[b] that there is always a key b in the Hash g, so all nodes can be identified by g.keys

HashGraph::DirectedGraph also includes TSort for Tarjan's algorithm

Install

gem source --add http://gemcutter.org
gem install hash_graph

Note on Patches/Pull Requests

  • Fork the project.

  • Make your feature addition or bug fix.

  • Add tests for it. This is important so I don't break it in a future version unintentionally.

  • Commit, do not mess with rakefile, version, or history. (if you want to have your own version, that is fine but bump version in a commit by itself I can ignore when I pull)

  • Send me a pull request. Bonus points for topic branches.

Copyright

Copyright © 2010 Trampoline Systems Ltd. See LICENSE for details.