find shortest paths from source to all vertices using Dijkstra’s Algorithm? For Dijkstra’s,i can find shortest paths from source to all vertices in the given graph but how can i calling the algorithm |V| times taking each vertex as a source and store all tables ???
For example :
What is the shortest path from 1 to 4? You need to print the value and the exact path vertices starting from 1 and ending at 4.
I am assuming here that you want to calculate the all-pairs shortest paths for a graph using Dijkstra's.

First, to find the shortest path between all pairs of vertices, you can create a $ |V|^2 $ matrix where row and column i and j corresponds to the shortest distance from vertex i to vertex j.

Second, to mark the all-path shortest paths' path, you simply set the parent property of each vertex j to the current vertex i you are visiting from every time you have to relax the edge going to j from i. Keeping one set of vertices and edge will be sufficient as an APSP will also produce a tree, similar to a SSSP tree.