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

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) Best, Tasos