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

Subject: Re: [Boost-users] [boost C++] algorithm for shortest path
From: Mikko Vainio (mikko.vainio_at_[hidden])
Date: 2009-10-13 00:47:26

Boost lzw wrote:
> 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

Boost.Graph has shortest path algorithms.

Cheers,
Mikko