|
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-15 08:35:42
This is not in my actual code! and not risponsible for my problem.
Its incorrect from the copy/paste.
!(std::isnan(edge_w))
its: std::isnan()
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