all3fox / algos-py / 19

Builds Branch Commit Type Ran Committer Via Coverage
19 master BellmanFord: minor renaming push Alexander Lisianoi travis-ci pending completion   set done
18 graph BellmanFord: minor renaming push Alexander Lisianoi travis-ci pending completion   set done
17 graph WeightedGraph: write __iter__, __getitem__, __eq__, __ne__ and __repr__. Change tests and mst code to fit push all3fox travis-ci pending completion   set done
16 graph Graph: add __eq__, __ne__ and __repr__, remove __setitem__ push all3fox travis-ci pending completion   set done
15 master Underscore similarity between Dijkstra and Bellman-Ford push all3fox travis-ci pending completion   set done
14 master Improve countsort push Alexander Lisianoi travis-ci pending completion   set done
13 master Implement Bellman-Ford, cycle detection looks way to bulky. push Alexander Lisianoi travis-ci pending completion   set done
12 bellman-ford Partially implemented Bellman-Ford: negative weights and cycle detection are not working, other than that -- A ok :) push all3fox travis-ci pending completion   set done
11 bellman-ford Put grap-related code and tests into respective subfolders: src/graph and tests/test_graph push all3fox travis-ci pending completion   set done
10 master Implement and test Dijkstra for Shortest Path Trees push Alexander Lisianoi travis-ci pending completion   set done
9 master Mergesort: drop min() in favour of some clever slicing and improve readability push Alexander Lisianoi travis-ci pending completion   set done
8 master UnionFind: Show better understanding of union (transitive) by improving tests push Alexander Lisianoi travis-ci pending completion   set done
7 spath Implement and test Dijkstra for Shortest Path Trees push all3fox travis-ci pending completion   set done
6 spath Add minimum spanning trees and their tests push all3fox travis-ci pending completion   set done
5 master Fix setitem - getitem test in bst: actually use getitem push all3fox travis-ci pending completion   set done