Hi, Thank you very much. I've just tried to use your implementation but I've some problems. What version of BGA are you using? I'm using version 1_33_0 but I can locate boost/io/format/std/pair.hpp that you include in your k_shortest.hpp (line 20). Because it is very important for me an implementation of this algorithm, I'm ready to change BGL version if it is necessary. Thanks a lot, Maurizio Vladimir Prus ha scritto:
Hi Giulio,
Hi all,
I'd like to extract all possible shortest path from a source to a destination... not only one path. Please, could you help me to resolve this problem?
Hi, I'm afraid BGL does not have such a algorithm at the moment.
One though that comes to me is the use another algorithm (not present in BGL, either), for finding k shortest paths. You'll then be getting next shortest path until the lengths are all the same.
There are several algorithms for finding k shortest paths, one being http://citeseer.ist.psu.edu/jimenez94algorithm.html
My implementation can be found at http://zigzag.cs.msu.su/~ghost/k_shortest Look specifically at the k_shortest.hpp file.
Of course, no warranties. This worked for me and I did test it against independent implementation, but the only way to find it it works for you is to test.
- Volodya
_______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users