Announce change to Bellman-Ford algorithm. This might be trite

[SVN r26190]

index.htm

@@ -126,6 +126,7 @@
 			      <LI><A href="libs/graph/doc/astar_search.html"><TT>astar_search</TT></A>, from Kristopher Beevers and Jufeng Peng.</LI>
 			      <LI><A href="libs/graph/doc/fruchterman_reingold.html"><TT>fruchterman_reingold_force_directed_layout</TT></A>, from Doug Gregor and Indiana University.</a></LI>
 			      <LI><A href="libs/graph/doc/biconnected_components.html"><tt>biconnected_components</tt> and <tt>articulation_points</tt></a>, from Indiana University.</a></li>
+			      <li><a href="libs/graph/doc/bellman_ford_shortest.html"><tt>bellman_ford_shortest_paths</tt></a> now permits one to specify the starting vertex, so that it will perform its own initialization.</li>
 			    </UL></LI>
 			</UL>