Hi all, Might be something really stupid but I cant think of a problem. (maybe its my limited experience with BGL common pitfalls) for (boost::tie(vi, vi_end) = boost::vertices(m_ugraph); vi != vi_end; ++vi) { depth += distances[*vi]; ..... path to:51886 distance to that node: 16.2 current total: 437998 path to:51887 distance to that node: 16.3 current total: 438014 path to:51888 distance to that node: 16.2 current total: 438031 path to:51889 distance to that node: 16.2 current total: 438047 path to:51890 distance to that node: 16.1 current total: 438063 path to:51891 distance to that node: 16.2 current total: 438079 path to:51892 distance to that node: 1.79769e+308 current total: 1.79769e+308 path to:51893 distance to that node: 16.3 current total: 1.79769e+308 path to:51894 distance to that node: 13.8 current total: 1.79769e+308 path to:51895 distance to that node: 13.9 current total: 1.79769e+308 I have checked my weights: if(edge_w<=0.0) edge_w = 0.1; if(edge_w >2.0) edge_w = 2.0; if( !(std::isnan(edge_w)) ) edge_w = 0.1; if( !(std::isfinite(edge_w)) ) edge_w = 0.1; boost::dijkstra_shortest_paths(m_ugraph, *vertex_iterator_begin, boost::distance_map(distanceMap)); typedef double Weight; typedef boost::property<boost::edge_weight_t, double> EdgeWeightProperty; typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, VertexProperties, EdgeWeightProperty> unGraph; Any ideas? Thanks a lot Tasos