Run initial tests on Fast ES-tree algorithm by calling ./run-tests
Algorithms Implemented
-- Naive decremental SSSP (BFS after each update) -- ES-Tree over binary search trees -- Fast ES-Tree with O(mn) total update time -- Randomized decremental APSP over Fast ES-Tree class