More rearrangement

[SVN r57613]

doc/table_of_contents.html

@@ -137,7 +137,7 @@
               <LI><A href="copy_graph.html"><tt>copy_graph</tt></A>
               <LI><A href="transpose_graph.html"><tt>transpose_graph</tt></A>
             </ol>
-          <LI>Core Algorithm Patterns
+          <LI>Core Searches
             <OL>
               <LI><A href="./breadth_first_search.html"><tt>breadth_first_search</tt></A>
               <LI><A href="./breadth_first_visit.html"><tt>breadth_first_visit</tt></A>
@@ -147,24 +147,33 @@
               <LI><A
               href="./undirected_dfs.html"><tt>undirected_dfs</tt></A>
             </OL>
-              <LI>Shortest Paths Algorithms
-                <OL>
-                  <LI><A href="./dijkstra_shortest_paths.html"><tt>dijkstra_shortest_paths</tt></A>
-                  <LI><A href="./dijkstra_shortest_paths_no_color_map.html"><tt>dijkstra_shortest_paths_no_color_map</tt></A>
-                  <LI><A href="./bellman_ford_shortest.html"><tt>bellman_ford_shortest_paths</tt></A>
-                  <LI><A href="./dag_shortest_paths.html"><tt>dag_shortest_paths</tt></A>
-                  <LI><A
-                  href="./johnson_all_pairs_shortest.html"><tt>johnson_all_pairs_shortest_paths</tt></A>
-                  <li><a href="floyd_warshall_shortest.html"><tt>floyd_warshall_all_pairs_shortest_paths</tt></a></li>
-                  <li><a href="r_c_shortest_paths.html"><tt>r_c_shortest_paths</tt> - resource-constrained shortest paths</a></li>
-                </OL>
-              <LI>Minimum Spanning Tree Algorithms
-                <OL>
-                  <LI><A
-                  href="./kruskal_min_spanning_tree.html"><tt>kruskal_minimum_spanning_tree</tt></A>
-                  <LI><A
-                  href="./prim_minimum_spanning_tree.html"><tt>prim_minimum_spanning_tree</tt></A>
-                </OL>
+
+          <li>Other Core Algorithms
+            <ol>
+              <LI><A href="topological_sort.html"><tt>topological_sort</tt></A>
+              <li><a href="transitive_closure.html"><tt>transitive_closure</tt></a>
+              <li><a href="lengauer_tarjan_dominator.htm"><tt>lengauer_tarjan_dominator_tree</tt></a></li>
+            </ol>
+
+      <LI>Shortest Paths / Cost Minimization Algorithms
+        <OL>
+          <LI><A href="./dijkstra_shortest_paths.html"><tt>dijkstra_shortest_paths</tt></A>
+          <LI><A href="./dijkstra_shortest_paths_no_color_map.html"><tt>dijkstra_shortest_paths_no_color_map</tt></A>
+          <LI><A href="./bellman_ford_shortest.html"><tt>bellman_ford_shortest_paths</tt></A>
+          <LI><A href="./dag_shortest_paths.html"><tt>dag_shortest_paths</tt></A>
+          <LI><A
+          href="./johnson_all_pairs_shortest.html"><tt>johnson_all_pairs_shortest_paths</tt></A>
+          <li><a href="floyd_warshall_shortest.html"><tt>floyd_warshall_all_pairs_shortest_paths</tt></a></li>
+          <li><a href="r_c_shortest_paths.html"><tt>r_c_shortest_paths</tt> - resource-constrained shortest paths</a></li>
+          <li><a href="astar_search.html"><tt>astar_search</tt></a></li>
+        </OL>
+      <LI>Minimum Spanning Tree Algorithms
+        <OL>
+          <LI><A
+          href="./kruskal_min_spanning_tree.html"><tt>kruskal_minimum_spanning_tree</tt></A>
+          <LI><A
+          href="./prim_minimum_spanning_tree.html"><tt>prim_minimum_spanning_tree</tt></A>
+        </OL>
       <LI>Connected Components Algorithms
       <OL>
           <LI><A href="./connected_components.html"><tt>connected_components</tt></A>
@@ -174,11 +183,11 @@
           <LI><a href="biconnected_components.html#sec:articulation_points"><tt>articulation_points</tt></a>
           <LI><a href="./incremental_components.html">Incremental Connected Components</a>
           <OL>
-          <LI><A href="./incremental_components.html#sec:initialize-incremental-components"><tt>initialize_incremental_components</tt></A>
-          <LI><A href="./incremental_components.html#sec:incremental-components"><tt>incremental_components</tt></A>
-          <LI><A
-          href="./incremental_components.html#sec:same-component"><tt>same_component</tt></A>
-          <LI><A href="./incremental_components.html#sec:component-index"><tt>component_index</tt></A>
+            <LI><A href="./incremental_components.html#sec:initialize-incremental-components"><tt>initialize_incremental_components</tt></A>
+            <LI><A href="./incremental_components.html#sec:incremental-components"><tt>incremental_components</tt></A>
+            <LI><A
+            href="./incremental_components.html#sec:same-component"><tt>same_component</tt></A>
+            <LI><A href="./incremental_components.html#sec:component-index"><tt>component_index</tt></A>
           </OL>
       </OL></LI>
               <LI>Maximum Flow and Matching Algorithms
@@ -199,30 +208,21 @@
                   <li><a href="sloan_start_end_vertices.htm"><tt>sloan_start_end_vertices</tt></a></li>
                 </ol>
               </li>
-              <li>Sparse Matrix Ordering Metrics
+              <li>Graph Metrics
                 <ol>
                   <LI><A href="./wavefront.htm"><tt>ith_wavefront</tt>, <tt>max_wavefront</tt>, <tt>aver_wavefront</tt>, and <tt>rms_wavefront</tt></A></LI>
                   <LI><a href="./bandwidth.html#sec:bandwidth"><tt>bandwidth</tt></a>
                   <LI><a href="./bandwidth.html#sec:ith-bandwidth"><tt>ith_bandwidth</tt></a>
+                  <LI><A href="betweenness_centrality.html"><tt>brandes_betweenness_centrality</tt></A></LI>
+                  <li><a href="howard_cycle_ratio.html"><tt>minimum_cycle_ratio</tt> and <tt>maximum_cycle_ratio</tt></a></li>
                 </ol>
               </li>
-              <LI><A href="topological_sort.html"><tt>topological_sort</tt></A>
-              <li><a href="transitive_closure.html"><tt>transitive_closure</tt></a>
               <li>Graph Structure Comparisons
                 <ol>
                   <LI><A href="isomorphism.html"><tt>isomorphism</tt></A>
                   <li><a href="mcgregor_common_subgraphs.html"><tt>mcgregor_common_subgraphs</tt></a></li>
                 </ol>
 
-              <li>Path and Tour Algorithms
-                  <ol>
-                      <li><a href="metric_tsp_approx.html"><tt>metric_tsp_approx</tt></a></li>
-                  </ol>
-              </li>
-
-              <LI><A href="sequential_vertex_coloring.html"><tt>sequential_vertex_coloring</tt></A>
-
-              <LI><A href="betweenness_centrality.html"><tt>brandes_betweenness_centrality</tt></A></LI>
               <li>Layout Algorithms
                 <ol>
                   <li><a href="random_layout.html"><tt>random_graph_layout</tt></a></li>
@@ -237,9 +237,6 @@
                   <li><a href="bc_clustering.html"><tt>betweenness_centrality_clustering</tt></a></li>
                   </ol>
               </li>
-      <li><a href="astar_search.html"><tt>astar_search</tt></a></li>
-              <li><a href="lengauer_tarjan_dominator.htm"><tt>lengauer_tarjan_dominator_tree</tt></a></li>
-              <li><a href="howard_cycle_ratio.html"><tt>minimum_cycle_ratio</tt> and <tt>maximum_cycle_ratio</tt></a></li>
               <li><a href="planar_graphs.html">Planar Graph Algorithms</a>
               <ol>
               <li><a href="boyer_myrvold.html">
@@ -261,6 +258,14 @@
               <li><a href="make_maximal_planar.html">
               <tt>make_maximal_planar</tt></a>
               </ol>
+
+              <li>Miscellaneous Algorithms
+                  <ol>
+                      <li><a href="metric_tsp_approx.html"><tt>metric_tsp_approx</tt></a></li>
+                      <LI><A href="sequential_vertex_coloring.html"><tt>sequential_vertex_coloring</tt></A>
+                  </ol>
+              </li>
+
        </OL>
 
          <li>Graph Input/Output