Re: [Boost-users] [Graph] dijkstra_shortest_paths: weird distance to vertex (1.79769e+308)

On Tue, 16 Apr 2013, The Maschine wrote:

Hi Jeremiah,

How do I eliminate cases like this? (not connected vertex) For you post I think you cannot use "isnan" or "isinfinate" right?

My only option is colormap or predecessors? (I havent use them yet)

Yes, or pass the actual floating-point infinity as the infinity in dijkstra_shortest_paths; if you do that, you should be able to use isinf(). -- Jeremiah Willcock