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

[SVN r32000]

1 files changed, 1 insertions, 0 deletions

diff --git a/index.htm b/index.htm
index c6df5398a7..a660f67fe9 100644
--- a/index.htm
+++ b/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>