[Boost-users] BGL example correction?

From: Peter Kümmel (syntheticpp_at_[hidden])
Date: 2005-04-05 14:26:26

Hello,

here maybe a small correction for
boost_1_32_0\libs\graph\example\file_dependencies.cpp,
line 176 :

dijkstra_shortest_paths_no_init
      (g, *i, &pred[0], &time[0], weight, indexmap,
-    compare, combine, 0,  // Since we are using > instead of >, we
+    compare, combine, //0,  // Since we are using > instead of >, we
      (std::numeric_limits<int>::max)(), // flip 0 and inf.
      default_dijkstra_visitor());

And I don't understand the comment '> instead of >' or what means '>,' ???
If I compile with zero distance the program crashes, although the declaration is:

dijkstra_shortest_paths_no_init
     (const VertexListGraph& g,
      typename graph_traits<VertexListGraph>::vertex_descriptor s,
      PredecessorMap predecessor, DistanceMap distance, WeightMap weight,
      IndexMap index_map,
      Compare compare,
      Combine combine,
->   DistZero zero,
      DijkstraVisitor vis)

Regrads,
Peter