[Boost-users] [boost C++] algorithm for shortest path

Hi there, For the following unidirectional (one-direct only) pairs: A-B; G-H; B-D; D-G; H-K; K-D; The shortest path between A and D is: A-B-D, but none between A and H. Which Boost library should I use to develop such an algorithm or any hint on design it ? Thanks in advance. Robert