index.htm, libs/graph/doc/table_of_contents.html:

  - Document the existence of the biconnected components algorithm

libs/graph/example/biconnected_components.cpp:
  - Clean up the GraphViz output a bit

libs/graph/doc/figs/biconnected.dot, libs/graph/doc/figs/biconnected.png,
libs/graph/doc/biconnected_components.html:
  - Documentation for biconnected components and articulation points

boost/graph/biconnected_components.hpp:
  - Minor type tweaks


[SVN r26105]

index.htm

@@ -125,6 +125,7 @@
 			      <LI><A href="libs/graph/doc/floyd_warshall_shortest.html"><TT>floyd_warshall_all_pairs_shortest_paths</TT></A>, from Lauren Foutz and Scott Hill.</LI>
 			      <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>
 			    </UL></LI>
 			</UL>
 			

libs/graph

@@ -1 +1 @@
-Subproject commit e7023ea88a1149cabc8300d3efe9192dfac4c556
+Subproject commit 8c2a5290ad1a35a149fb0addec2c86f3af80a169