Single-Destination Shortest Paths Problem is a type of shortest-path problem where given a vertex v we need to find the shortest path FROM every other node