|
Boost Users : |
Subject: [Boost-users] [BGL] A* implementation
From: Knut Krause (knut.krause_at_[hidden])
Date: 2014-01-21 09:24:44
Hi,
I'm still considering to use the BGL for my large scale path finding problem.
Sadly I don't fully understand the implementation of A* used in boost.
Does it use optimizations like bidirectional A* and so on or can I activate
those somehow? I think otherwise I'd have to implement my own version of A*.
Regards
Knut
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