Single-Pair Shortest Path Problem is a type of shortest-path problem where given 2 vertices u and v, we need to find the shortest path between them Algorithms