One simple (loopless) path, as kShortestPaths lists them.
Edge IDs along the path, one per hop.
Ordered node IDs from source to target.
One simple (loopless) path, as kShortestPaths lists them.