[Boost-users] [BGL] A* implementation

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