|
Boost Users : |
Subject: [Boost-users] All-pairs SP algorithms -> Determine the path
From: GOO Creations (goocreations_at_[hidden])
Date: 2011-04-15 10:25:23
Hi again
I've noticed that the all-pairs SP algorithms (eg: Johnson,
Floyd-Marshall) only "return" a distance matrix that hold the shortest
distances between any node n and n'. Is there a way to determine the
actual path (eg: n2-n4-n5-n1-n0) between these nodes using the all-pairs
algorithms?
Chris
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net