Be consistent about initialize_vertex calls

[SVN r34135]

doc/BellmanFordVisitor.html

@@ -79,16 +79,6 @@ none
 <th>Name</th><th>Expression</th><th>Return Type</th><th>Description</th>
 </tr>
 
-<tr>
-<td>Initialize Vertex</td>
-<td><tt>vis.initialize_vertex(s, g)</tt></td>
-<td><tt>void</tt></td>
-<td>
-This is invoked on every vertex of the graph before the start of the
-graph search.
-</td>
-</tr>
-
 <tr>
 <td>Examine Edge</td>
 <td><tt>vis.examine_edge(e, g)</tt></td>

include/boost/graph/astar_search.hpp

@@ -301,6 +301,7 @@ namespace boost {
       put(distance, *ui, inf);
       put(cost, *ui, inf);
       put(predecessor, *ui, *ui);
+      vis.initialize_vertex(*ui, g);
     }
     put(distance, s, zero);
     put(cost, s, h(s));

include/boost/graph/dijkstra_shortest_paths.hpp

@@ -32,6 +32,7 @@ namespace boost {
   struct DijkstraVisitorConcept {
     void constraints() {
       function_requires< CopyConstructibleConcept<Visitor> >();
+      vis.initialize_vertex(u, g);
       vis.discover_vertex(u, g);
       vis.examine_vertex(u, g);
       vis.examine_edge(e, g);