Function as part of a class in C++

Write DijkstrasPath(int vertex) - This function determines the single-source shortest path for all vertices in the graph, beginning with the vertex specified as the argument. It must use a set to store the cost-so-far for vertices as they are processed. The output for each vertex will show its total cost from the source vertex, along with the proceeding vertex through which the shortest path is obtained. For the source (first) vertex, the preceeding vertex is shown as -1.

Layout of output

Shortest path from vertex 0 to:

Vertex 0 cost: 0 through vertex -1

Vertex 1 cost: 2 through vertex 0

Vertex 2 cost: 3 through vertex 3

Vertex 3 cost: 1 through vertex 0

Vertex 4 cost: 3 through vertex 3