C++ Boost

目錄:Boost圖庫BGL Book

  1. Introduction to the BGL圖庫簡介
  2. History 歷史
  3. List of BGL Users Boost圖庫用戶列表
  4. Publications 出版
  5. Acknowledgements 感謝
  6. A Quick Tour of the Boost Graph Library. Boost圖庫快速指南
  7. Review of Elementary Graph Theory 圖論基礎回顧
  8. Boost Graph Library Tutorial BGL指南
    1. Property Maps 屬性映射
    2. The adjacency_list class adjacency_list
  9. Examples 範例
    1. File Dependency Example 文件關聯範例
    2. Six Degrees of Kevin Bacon 六度分離理論
    3. Graph Coloring 圖染色
    4. Sparse Matrix Ordering 稀疏矩陣排序
  10. Extending the Boost Graph Library 圖庫擴展
    1. Constructing graph algorithms with BGL 用Boost圖庫構建圖相關算法
    2. Converting Existing Graphs to BGL 非BGL圖轉換到BGL
  11. The Boost Graph Interface Boost圖庫接口
    1. Graph 圖
    2. Incidence Graph 關聯圖
    3. Bidirectional Graph 雙向圖
    4. Adjacency Graph 鄰接圖
    5. Vertex List Graph 點表圖
    6. Edge List Graph 邊表圖
    7. Vertex and Edge List Graph 點邊列表圖
    8. Mutable Graph 可變圖
    9. Property Graph 屬性圖
    10. Mutable Property Graph 可變特性圖
  12. The Property Map Library 特性映射庫 (technically not part of the graph library, but used a lot here)
  13. (Python)Python bindings
  14. Visitor Concepts 遍歷器概念
    1. BFS Visitor 廣度優先遍歷器
    2. DFS Visitor 深度優先遍歷器
    3. Dijkstra Visitor Dijkstra 遍歷器
    4. Bellman Ford Visitor Bellman Ford遍歷器
    5. A* Visitor A*遍歷器
    6. Event Visitor 事件遍歷器
    7. Planar Face Visitor 平面遍歷器
  15. EventVisitorList Adaptors 事件遍歷器列表適配器
    1. Event Visitor List 事件遍歷器列表
    2. bfs_visitor
    3. dfs_visitor
    4. dijkstra_visitor
    5. bellman_visitor
    6. astar_visitor
  16. Event Visitors 事件遍歷器
    1. predecessor_recorder
    2. distance_recorder
    3. time_stamper
    4. property_writer
  17. Graph classes 圖相關類
    1. adjacency_list
    2. adjacency_matrix
    3. compressed_sparse_row_graph
  18. Graph Adaptors 圖相關適配器
    1. subgraph
    2. edge_list
    3. reverse_graph
    4. filtered_graph
    5. Vector as Graph *
    6. Matrix as Graph*
    7. Leda Graph *
    8. Stanford GraphBase
  19. Iterator Adaptors 迭代器適配器
    1. adjacency_iterator
    2. inv_adjacency_iterator
  20. Traits classes 特性類
    1. graph_traits
    2. adjacency_list_traits
    3. property_map
  21. Algorithms 算法
    1. bgl_named_params
    2. Core Algorithm Patterns 核心算法模式
      1. breadth_first_search
      2. breadth_first_visit
      3. depth_first_search
      4. depth_first_visit
      5. undirected_dfs
    3. Graph Algorithms 圖算法
      1. Shortest Paths Algorithms 最短路徑算法
        1. dijkstra_shortest_paths
        2. bellman_ford_shortest_paths
        3. dag_shortest_paths
        4. johnson_all_pairs_shortest_paths
        5. floyd_warshall_all_pairs_shortest_paths
      2. Minimum Spanning Tree Algorithms 最小生成樹算法
        1. kruskal_minimum_spanning_tree
        2. prim_minimum_spanning_tree
      3. Connected Components Algorithms 連通分支算法
        1. connected_components
        2. strong_components
        3. biconnected_components
        4. articulation_points
        5. Incremental Connected Components 增量連通分支
          1. initialize_incremental_components
          2. incremental_components
          3. same_component
          4. component_index
      4. Maximum Flow and Matching Algorithms 最大流和最大匹配算法
        1. edmunds_karp_max_flow
        2. push_relabel_max_flow
        3. kolmogorov_max_flow
        4. edmonds_maximum_cardinality_matching
      5. Sparse Matrix Ordering Algorithms 稀疏矩陣排序算法
        1. cuthill_mckee_ordering
        2. king_ordering
        3. minimum_degree_ordering
      6. topological_sort
      7. transitive_closure
      8. copy_graph
      9. transpose_graph
      10. isomorphism
      11. sequential_vertex_coloring
      12. sloan_ordering
      13. sloan_start_end_vertices
      14. ith_wavefront, max_wavefront, aver_wavefront, and rms_wavefront
      15. brandes_betweenness_centrality
      16. Layout algorithms 排樣算法
        1. random_graph_layout
        2. circle_layout
        3. kamada_kawai_spring_layout
        4. fruchterman_reingold_force_directed_layout
        5. gursoy_atun_layout
      17. Clustering algorithms 聚類算法
        1. betweenness_centrality_clustering
      18. astar_search
      19. lengauer_tarjan_dominator_tree
      20. minimum_cycle_ratio and maximum_cycle_ratio
      21. Planar Graph Algorithms 平面圖算法
        1. boyer_myrvold_planarity_test
        2. planar_face_traversal
        3. planar_canonical_ordering
        4. chrobak_payne_straight_line_drawing
        5. is_straight_line_drawing
        6. is_kuratowski_subgraph
        7. make_connected
        8. make_biconnected_planar
        9. make_maximal_planar
      22. lengauer_tarjan_dominator_tree
  22. Graph Input/Output 圖的輸入/輸出
    1. AT&T Graphviz: read_graphviz, write_graphviz
    2. DIMACS Max-flow: read_dimacs_max_flow, write_dimacs_max_flow
    3. GraphML: read_graphml and write_graphml
  23. Auxiliary Concepts, Classes, and Functions 相關類和函數的一些補充
    1. property
    2. ColorValue
    3. Buffer
    4. BasicMatrix
    5. incident
    6. opposite
    7. bandwidth
    8. ith_bandwidth
    9. Tools for random graphs
      1. random_vertex
      2. random_edge
      3. generate_random_graph
      4. randomize_property
      5. erdos_renyi_iterator
      6. sorted_erdos_renyi_iterator
      7. plod_iterator
      8. small_world_iterator
  24. Challenge and To-Do List 難題和未做列表
  25. Trouble Shooting 疑難解答
  26. Known Problems 已知問題
  27. FAQ
  28. BGL Book Errata BGL書籍刊誤表

* Items marked have not yet been documented. *表示還沒有相關文檔


Copyright c 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
Andrew Lumsdaine, Indiana University (lums@osl.iu.edu)