How do we covert the shortest distance problem in to a single source problem?

The shortest distance problem can be converted into a single-source problem using algorithms such as Dijkstra's
algorithm or Bellman-Ford algorithm. Here's how:

Single-Source Shortest Path (SSSP) Problem: In this problem, you have a graph with weighted edges, and you
need to find the shortest path from a single source vertex to all other vertices in the graph

Converting Shortest Distance to SSSP: If you have a problem where you need to find the shortest distance between
all pairs of vertices in a graph, you can convert it into a single-source problem by selecting one vertex as the source
and running a single-source shortest path algorithm from that vertex to all other vertices.

Dijkstra's Algorithm: This algorithm finds the shortest path from a single source vertex to all other vertices in a
weighted graph with non-negative edge weights. It maintains a set of vertices whose shortest distance from the
source is already determined and continually expands this set until it reaches the destination vertex.

Bellman-Ford Algorithm: This algorithm finds the shortest paths from a single source vertex to all other vertices in a
weighted graph, even if the graph contains negative weight edges (as long as there are no negative weight cycles). It
iteratively relaxes the edges of the graph, improving the estimates of the shortest path until it converges to the
correct solution.