Documentation for JongSoo Park's dominator tree implementation

[SVN r32115]

index.htm

@@ -90,6 +90,7 @@
                         "more/background.html">Background Information
                         page</a> has introductory material to help those
                         educating their organization about Boost.</span></p>
+
                       </div>
                     </div>
                   </div>
@@ -142,6 +143,7 @@
                            Library</a>:</span>
                            <ul>
                              <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/lengauer_tarjan_dominator_tree.htm"><tt>lengauer_tarjan_dominator_tree</tt></a>, from JongSoo Park.</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>

libs/graph

@@ -1 +1 @@
-Subproject commit 1e416130db08d26cbd09c360e0895c8b5705a0eb
+Subproject commit 8041171b334089886c1b9a8475aef154fee345b8