nvGraph and Single Source Shortest Path (SSSP)

Hi.

I try to use new nvGraph library and has a question. Is it possible to get not only shortest path DISTANCE, but also a PATH? I use boost library at now (boost::dijkstra_shortest_paths) and with it I can do “reverse travel” from destination to source and “restore” shortest path trajectory.

Hi - Has anyone found an answer for this . There is a traverse call to find all the shortest path but it does not seem to allow to set weights ?