Boost logo

Boost Users :

Subject: Re: [Boost-users] [Graph] dijkstra_shortest_paths: weird distance to vertex (1.79769e+308)
From: The Maschine (justthemaschine_at_[hidden])
Date: 2013-04-16 04:28:51


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


Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net