From 770ce8cf8610d1dcd6ecae0d0dff0ec646ef407f Mon Sep 17 00:00:00 2001 From: Jeremiah Willcock Date: Thu, 12 Nov 2009 19:36:27 +0000 Subject: [PATCH] More rearrangement [SVN r57613] --- doc/table_of_contents.html | 83 ++++++++++++++++++++------------------ 1 file changed, 44 insertions(+), 39 deletions(-) diff --git a/doc/table_of_contents.html b/doc/table_of_contents.html index d387faf0..ddc06de3 100644 --- a/doc/table_of_contents.html +++ b/doc/table_of_contents.html @@ -137,7 +137,7 @@
  • copy_graph
  • transpose_graph -
  • Core Algorithm Patterns +
  • Core Searches
    1. breadth_first_search
    2. breadth_first_visit @@ -147,24 +147,33 @@
    3. undirected_dfs
    -
  • Shortest Paths Algorithms -
      -
    1. dijkstra_shortest_paths -
    2. dijkstra_shortest_paths_no_color_map -
    3. bellman_ford_shortest_paths -
    4. dag_shortest_paths -
    5. johnson_all_pairs_shortest_paths -
    6. floyd_warshall_all_pairs_shortest_paths
      7. -
    7. r_c_shortest_paths - resource-constrained shortest paths
      8. -
    -
  • Minimum Spanning Tree Algorithms -
      -
    1. kruskal_minimum_spanning_tree -
    2. prim_minimum_spanning_tree -
    + +
  • Other Core Algorithms +
      +
    1. topological_sort +
    2. transitive_closure +
    3. lengauer_tarjan_dominator_tree
      4. +
    + +
  • Shortest Paths / Cost Minimization Algorithms +
      +
    1. dijkstra_shortest_paths +
    2. dijkstra_shortest_paths_no_color_map +
    3. bellman_ford_shortest_paths +
    4. dag_shortest_paths +
    5. johnson_all_pairs_shortest_paths +
    6. floyd_warshall_all_pairs_shortest_paths
      7. +
    7. r_c_shortest_paths - resource-constrained shortest paths
      8. +
    8. astar_search
      9. +
    +
  • Minimum Spanning Tree Algorithms +
      +
    1. kruskal_minimum_spanning_tree +
    2. prim_minimum_spanning_tree +
  • Connected Components Algorithms
    1. connected_components @@ -174,11 +183,11 @@
    2. articulation_points
    3. Incremental Connected Components
        -
      1. initialize_incremental_components -
      2. incremental_components -
      3. same_component -
      4. component_index +
      5. initialize_incremental_components +
      6. incremental_components +
      7. same_component +
      8. component_index
  • Maximum Flow and Matching Algorithms @@ -199,30 +208,21 @@
  • sloan_start_end_vertices
    • -
  • Sparse Matrix Ordering Metrics +
  • Graph Metrics
    1. ith_wavefront, max_wavefront, aver_wavefront, and rms_wavefront
    2. bandwidth
    3. ith_bandwidth +
    4. brandes_betweenness_centrality
      5. +
    5. minimum_cycle_ratio and maximum_cycle_ratio
    • -
  • topological_sort -
  • transitive_closure
  • Graph Structure Comparisons
    1. isomorphism
    2. mcgregor_common_subgraphs
    -
  • Path and Tour Algorithms -
      -
    1. metric_tsp_approx
      2. -
    -
    • - -
  • sequential_vertex_coloring - -
  • brandes_betweenness_centrality
  • Layout Algorithms
    1. random_graph_layout
      2. @@ -237,9 +237,6 @@
    2. betweenness_centrality_clustering
    • -
  • astar_search
    • -
  • lengauer_tarjan_dominator_tree
    • -
  • minimum_cycle_ratio and maximum_cycle_ratio
  • Planar Graph Algorithms
    1. @@ -261,6 +258,14 @@
    2. make_maximal_planar
    + +
  • Miscellaneous Algorithms +
      +
    1. metric_tsp_approx
      2. +
    2. sequential_vertex_coloring +
    +
    • +
  • Graph Input/Output