Python test cases of popular algorithm for training.
- Shortest Path
- bellman_ford
- washall_floyd
- dikstra (array)
- dikstra (priority queue)
- Sort
- quick sort
- quick select
- merge sort
- union find
- toporogical sort
- binary_search
Pick up an algorithm and implement it as your daily training.
$ ruby -e 'puts ["bellman_ford", "washall_floyd", "dikstra (array)","dikstra (priority queue)","quick sort", "quick select", merge sort", "union find","toporogical sort","binary_search"].sample'
bellman_ford
$ cp mock/bellman_ford.py .
# edit ./bellman_ford.py and implement Bellman–Ford algorithm