[Boost-commit] svn:boost r57613 - trunk/libs/graph/doc

Subject: [Boost-commit] svn:boost r57613 - trunk/libs/graph/doc
From: jewillco_at_[hidden]
Date: 2009-11-12 14:36:28

Author: jewillco
Date: 2009-11-12 14:36:27 EST (Thu, 12 Nov 2009)
New Revision: 57613
URL: http://svn.boost.org/trac/boost/changeset/57613

Log:
More rearrangement
Text files modified: 
   trunk/libs/graph/doc/table_of_contents.html |    83 +++++++++++++++++++++------------------ 
   1 files changed, 44 insertions(+), 39 deletions(-)

Modified: trunk/libs/graph/doc/table_of_contents.html
==============================================================================
--- trunk/libs/graph/doc/table_of_contents.html	(original)
+++ trunk/libs/graph/doc/table_of_contents.html	2009-11-12 14:36:27 EST (Thu, 12 Nov 2009)
@@ -137,7 +137,7 @@
               <LI>copy_graph
               <LI>transpose_graph
             </ol>
-          <LI>Core Algorithm Patterns
+          <LI>Core Searches
             <OL>
               <LI>breadth_first_search
               <LI>breadth_first_visit
@@ -147,24 +147,33 @@
               <LI><A
               href="./undirected_dfs.html"><tt>undirected_dfs</tt></A>
             </OL>
-              <LI>Shortest Paths Algorithms
-                <OL>
-                  <LI>dijkstra_shortest_paths
-                  <LI>dijkstra_shortest_paths_no_color_map
-                  <LI>bellman_ford_shortest_paths
-                  <LI>dag_shortest_paths
-                  <LI><A
-                  href="./johnson_all_pairs_shortest.html"><tt>johnson_all_pairs_shortest_paths</tt></A>
-                  <li>floyd_warshall_all_pairs_shortest_paths</li>
-                  <li>r_c_shortest_paths - resource-constrained shortest paths</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>topological_sort
+              <li>transitive_closure
+              <li>lengauer_tarjan_dominator_tree</li>
+            </ol>
+
+      <LI>Shortest Paths / Cost Minimization Algorithms
+        <OL>
+          <LI>dijkstra_shortest_paths
+          <LI>dijkstra_shortest_paths_no_color_map
+          <LI>bellman_ford_shortest_paths
+          <LI>dag_shortest_paths
+          <LI><A
+          href="./johnson_all_pairs_shortest.html"><tt>johnson_all_pairs_shortest_paths</tt></A>
+          <li>floyd_warshall_all_pairs_shortest_paths</li>
+          <li>r_c_shortest_paths - resource-constrained shortest paths</li>
+          <li>astar_search</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>connected_components
@@ -174,11 +183,11 @@
           <LI>articulation_points
           <LI>Incremental Connected Components
           <OL>
-          <LI>initialize_incremental_components
-          <LI>incremental_components
-          <LI><A
-          href="./incremental_components.html#sec:same-component"><tt>same_component</tt></A>
-          <LI>component_index
+            <LI>initialize_incremental_components
+            <LI>incremental_components
+            <LI><A
+            href="./incremental_components.html#sec:same-component"><tt>same_component</tt></A>
+            <LI>component_index
           </OL>
       </OL></LI>
               <LI>Maximum Flow and Matching Algorithms
@@ -199,30 +208,21 @@
                   <li>sloan_start_end_vertices</li>
                 </ol>
               </li>
-              <li>Sparse Matrix Ordering Metrics
+              <li>Graph Metrics
                 <ol>
                   <LI>ith_wavefront, max_wavefront, aver_wavefront, and rms_wavefront</LI>
                   <LI>bandwidth
                   <LI>ith_bandwidth
+                  <LI>brandes_betweenness_centrality</LI>
+                  <li>minimum_cycle_ratio and maximum_cycle_ratio</li>
                 </ol>
               </li>
-              <LI>topological_sort
-              <li>transitive_closure
               <li>Graph Structure Comparisons
                 <ol>
                   <LI>isomorphism
                   <li>mcgregor_common_subgraphs</li>
                 </ol>
 
-              <li>Path and Tour Algorithms
-                  <ol>
-                      <li>metric_tsp_approx</li>
-                  </ol>
-              </li>
-
-              <LI>sequential_vertex_coloring
-
-              <LI>brandes_betweenness_centrality</LI>
               <li>Layout Algorithms
                 <ol>
                   <li>random_graph_layout</li>
@@ -237,9 +237,6 @@
                   <li>betweenness_centrality_clustering</li>
                   </ol>
               </li>
-      <li>astar_search</li>
-              <li>lengauer_tarjan_dominator_tree</li>
-              <li>minimum_cycle_ratio and maximum_cycle_ratio</li>
               <li>Planar Graph Algorithms
               <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>metric_tsp_approx</li>
+                      <LI>sequential_vertex_coloring
+                  </ol>
+              </li>
+
        </OL>
 
          <li>Graph Input/Output