c80b5559ce
2014-12 Release 0.5.0 This release mainly contains the contributions of Kirill, who added many algorithms to the library. Thank you Kirill! * @matiaskorhonen: Fixes the image paths in the README (#14) * @monora: Implicit graph example fails (#13) * @KL-7: Implement Graph#bipartite_sets. (#12) * @monora: syntax error in dot file for undirected graph (#11) * @KL-7: Edmonds-Karp algorithm for maximum flow (#10) * @KL-7: Prim's algorithm for minimum spanning tree (#9) * @carlosantoniodasilva: Run tests on Ruby 2.0 and remove deprecation warning (#8) * @KL-7: Bellman-Ford shortest paths algorithm (#7) * @KL-7: Minor improvements (asserts) for Dijkstra algorithm (#6) * @KL-7: Add Dijkstra shortest path algorithm. (#5) * @KL-7: Indentation and whitespaces clean up of examples (#4) * @KL-7: Travis configuration and README updates (#3) * @KL-7: Code clean up and configuration updates (#2) * @aschoerk: Renamed test-directory, (includes Rakefile), fixed TestComponents (#1)
5 lines
222 B
Text
5 lines
222 B
Text
$NetBSD: distinfo,v 1.4 2015/02/02 13:00:07 taca Exp $
|
|
|
|
SHA1 (rgl-0.5.0.gem) = 4bd42d7dab7158b7f2ae9f83a9b51ab8e949793d
|
|
RMD160 (rgl-0.5.0.gem) = 7b02a70a87dd4c8ab92ff8336366b235de3421af
|
|
Size (rgl-0.5.0.gem) = 235008 bytes
|