The single-source shortest path problem is one of the most studied problems in computer
science. Nevertheless, it is infamous for being notoriously hard to parallelize due to the so …