Initialization fixes for Dijkstra's single-source shortest paths and breadth-first search

[SVN r32000]

index.htm

@@ -144,6 +144,7 @@
                              <li><a href="libs/graph/doc/maximum_matching.html"><tt>edmonds_maximum_cardinality_matching</tt></a>, from Aaron Windsor.</li>
                              <li><a href="libs/graph/doc/compressed_sparse_row.html"><tt>compressed_sparse_row_graph</tt></a>, from Jeremiah Willcock and Douglas Gregor of Indiana University.</li>
                              <li><a href="libs/graph/doc/biconnected_components.html"><tt>biconnected_components</tt></a> now supports a visitor and named parameters, from Janusz Piwowarski.</li>
+                             <li><a href="libs/graph/doc/dijkstra_shortest_paths.html"><tt>dijkstra_shortest_paths</tt></a> now calls <tt>vis.initialize_vertex</tt> for each vertex during initialization.</li>
                            </ul></li>
                          </ul>
                         </div>

libs/graph

@@ -1 +1 @@
-Subproject commit 18586182a1e6b0e5ade176fcf40cd21dde7cdd5e
+Subproject commit 02f8dbe5926599a3a5ab78405b8a5a08fc252ad0