There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on ...

As with all "classic algorithms," its output was deterministic: it produced the same result for the same input every time. It would always finish, and it always produced the optimal, correct result.