What is the output of Dijkstra's algorithm?

What is the output of Dijkstra's algorithm?

Step 1: Start with a graph that has nodes (points) and edges (connections between points).
Step 2: Choose a starting point (source) in the graph.
Step 3: Set the distance to the source node as 0 and all other nodes as infinity (unknown distance).
Step 4: Mark the source node as visited.
Step 5: Look at all the neighboring nodes of the source node and calculate their distances from the source.
Step 6: Update the distances of the neighboring nodes if the calculated distance is shorter than the previously known distance.
Step 7: Mark the neighboring node with the smallest distance as the new current node.
Step 8: Repeat steps 5 to 7 until all nodes have been visited.
Step 9: The output will be the shortest distance from the source to each node in the graph.

No concepts available.