Single-Source Shortest Path (SSSP) is an algorithmic problem in graph theory that aims to find the shortest paths from a given source vertex to all other vertices in a weighted graph. This problem is fundamental in computer science and is efficiently solved by algorithms like Dijkstra's and Bellman-Ford, each with its own strengths depending on the graph's properties.