Re: [Boost-users] [Graph] dijkstra_shortest_paths: weird distance to vertex (1.79769e+308)
16 Apr
2013
16 Apr
'13
8:28 a.m.
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
16 Apr
16 Apr
2:08 p.m.
New subject: [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
4494
Age (days ago)
4494
Last active (days ago)
0 comments
1 participants
participants (1)
-
Jeremiah Willcock -
The Maschine