Algorithms, Parallelism And Fine-Grained Complexity For Shortest Path Problems In Sparse Graphs