I am a newbie to nvGraph. I would like to not only find the weight of the shortest path, but the actual path (i.e. sequence of vertices) from the source to each destination vertex. I am seeing one other person asking the same question, but it has not been answered for the past two years.
Is there a way to find the traversal routes from the source to the destination for the SSSP problem. If the function call can pass out the predecessor of each vertex, then one can reconstruct the path from the destination to the source and thereby reverse it and find the forward path.
Please advice on how to do this using nvGraph.