* xref:index.adoc[Introduction]
* xref:primitives.adoc[Primitives]
* xref:graph_classes/overview.adoc[Graph Classes]
** xref:graph_classes/adjacency_list.adoc[Adjacency List]
** xref:graph_classes/adjacency_matrix.adoc[Adjacency Matrix]
** xref:graph_classes/compressed_sparse_row.adoc[Compressed Sparse Row Graph]
* xref:property_maps/overview.adoc[Property Maps]
** xref:property_maps/bundled.adoc[Bundled Properties]
** xref:property_maps/external.adoc[External Properties]
** xref:property_maps/tags.adoc[Internal Tags (Legacy)]
** xref:property_maps/pitfalls.adoc[Common Mistakes]
* xref:visitors/overview.adoc[Visitors]
** Pre-built Event Visitors
*** xref:visitors/predecessor_recorder.adoc[Vertex Predecessor Recorder]
*** xref:visitors/edge_predecessor_recorder.adoc[Edge Predecessor Recorder]
*** xref:visitors/distance_recorder.adoc[Distance Recorder]
*** xref:visitors/property_put.adoc[Property Put]
*** xref:visitors/property_writer.adoc[Property Writer]
*** xref:visitors/time_stamper.adoc[Time Stamper]
*** xref:visitors/null_visitor.adoc[Null Visitor]
** Algorithm-specific visitors
*** xref:visitors/tsp_tour_visitor.adoc[TSP Tour Visitor]
*** xref:visitors/tsp_tour_len_visitor.adoc[TSP Tour Len Visitor]
*** xref:visitors/astar_heuristic.adoc[A* Heuristic (Zero)]
** Concepts
*** xref:visitors/BFSVisitor.adoc[BFS Visitor]
*** xref:visitors/DFSVisitor.adoc[DFS Visitor]
*** xref:visitors/DijkstraVisitor.adoc[Dijkstra Visitor]
*** xref:visitors/BellmanFordVisitor.adoc[Bellman-Ford Visitor]
*** xref:visitors/AStarVisitor.adoc[A* Visitor]
*** xref:visitors/AStarHeuristic.adoc[A* Heuristic]
*** xref:visitors/EventVisitor.adoc[Event Visitor]
*** xref:visitors/PlanarFaceVisitor.adoc[Planar Face Visitor]
*** xref:visitors/TSPTourVisitor.adoc[TSP Tour Visitor]
*** xref:visitors/AddEdgeVisitor.adoc[Add Edge Visitor]
** Algorithm adaptors
*** xref:visitors/EventVisitorList.adoc[Event Visitor List]
*** xref:visitors/bfs_visitor.adoc[BFS Visitor Adaptor]
*** xref:visitors/dfs_visitor.adoc[DFS Visitor Adaptor]
*** xref:visitors/dijkstra_visitor.adoc[Dijkstra Visitor Adaptor]
*** xref:visitors/bellman_visitor.adoc[Bellman-Ford Visitor Adaptor]
*** xref:visitors/astar_visitor.adoc[A* Visitor Adaptor]
* xref:algorithms/overview.adoc[Algorithms]
** xref:algorithms/traversal/traversal_overview.adoc[Traversal]
*** xref:algorithms/traversal/breadth_first_search.adoc[Breadth First Search]
*** xref:algorithms/traversal/breadth_first_visit.adoc[Breadth First Visit]
*** xref:algorithms/traversal/depth_first_search.adoc[Depth First Search]
*** xref:algorithms/traversal/depth_first_visit.adoc[Depth First Visit]
*** xref:algorithms/traversal/undirected_dfs.adoc[Undirected DFS]
** xref:algorithms/shortest_paths/shortest_paths_overview.adoc[Shortest Paths]
*** xref:algorithms/shortest_paths/dijkstra_shortest_paths.adoc[Dijkstra Shortest Paths]
*** xref:algorithms/shortest_paths/dijkstra_shortest_paths_no_color_map.adoc[Dijkstra Shortest Paths No Color Map]
*** xref:algorithms/shortest_paths/bellman_ford_shortest.adoc[Bellman-Ford Shortest Paths]
*** xref:algorithms/shortest_paths/dag_shortest_paths.adoc[DAG Shortest Paths]
*** xref:algorithms/shortest_paths/johnson_all_pairs_shortest.adoc[Johnson All Pairs Shortest Paths]
*** xref:algorithms/shortest_paths/floyd_warshall_shortest.adoc[Floyd-Warshall All Pairs Shortest Paths]
*** xref:algorithms/shortest_paths/r_c_shortest_paths.adoc[Resource-Constrained Shortest Paths]
*** xref:algorithms/shortest_paths/astar_search.adoc[A* Search]
** xref:algorithms/spanning_trees/spanning_trees_overview.adoc[Spanning Trees]
*** xref:algorithms/spanning_trees/kruskal_min_spanning_tree.adoc[Kruskal Minimum Spanning Tree]
*** xref:algorithms/spanning_trees/prim_minimum_spanning_tree.adoc[Prim Minimum Spanning Tree]
*** xref:algorithms/spanning_trees/random_spanning_tree.adoc[Random Spanning Tree]
*** xref:algorithms/spanning_trees/two_graphs_common_spanning_trees.adoc[Two Graphs Common Spanning Trees]
** xref:algorithms/connected_components/connected_components_overview.adoc[Connected Components]
*** xref:algorithms/connected_components/connected_components.adoc[Connected Components]
*** xref:algorithms/connected_components/strong_components.adoc[Strong Components]
*** xref:algorithms/connected_components/biconnected_components.adoc[Biconnected Components]
*** xref:algorithms/connected_components/incremental_components.adoc[Incremental Components]
** xref:algorithms/network_flow/network_flow_overview.adoc[Network Flow]
*** xref:algorithms/network_flow/edmonds_karp_max_flow.adoc[Edmonds-Karp Max Flow]
*** xref:algorithms/network_flow/push_relabel_max_flow.adoc[Push-Relabel Max Flow]
*** xref:algorithms/network_flow/boykov_kolmogorov_max_flow.adoc[Boykov-Kolmogorov Max Flow]
*** xref:algorithms/network_flow/stoer_wagner_min_cut.adoc[Stoer-Wagner Min Cut]
*** xref:algorithms/network_flow/cycle_canceling.adoc[Cycle Canceling]
*** xref:algorithms/network_flow/successive_shortest_path_nonnegative_weights.adoc[Successive Shortest Path Nonnegative Weights]
*** xref:algorithms/network_flow/find_flow_cost.adoc[Find Flow Cost]
*** xref:algorithms/network_flow/maximum_matching.adoc[Edmonds Maximum Cardinality Matching]
*** xref:algorithms/network_flow/maximum_weighted_matching.adoc[Maximum Weighted Matching]
** xref:algorithms/topological_sort/topological_sort_overview.adoc[Topological Sort]
*** xref:algorithms/topological_sort/topological_sort.adoc[Topological Sort]
** xref:algorithms/coloring/coloring_overview.adoc[Graph Coloring]
*** xref:algorithms/coloring/sequential_vertex_coloring.adoc[Sequential Vertex Coloring]
*** xref:algorithms/coloring/edge_coloring.adoc[Edge Coloring]
*** xref:algorithms/coloring/is_bipartite.adoc[Is Bipartite]
*** xref:algorithms/coloring/find_odd_cycle.adoc[Find Odd Cycle]
** xref:algorithms/connectivity/connectivity_overview.adoc[Connectivity]
*** xref:algorithms/connectivity/edge_connectivity.adoc[Edge Connectivity]
*** xref:algorithms/connectivity/st_connected.adoc[ST Connected]
** xref:algorithms/metrics/metrics_overview.adoc[Graph Metrics]
*** xref:algorithms/metrics/page_rank.adoc[PageRank]
*** xref:algorithms/metrics/betweenness_centrality.adoc[Brandes Betweenness Centrality]
*** xref:algorithms/metrics/degree_centrality.adoc[Degree Centrality]
*** xref:algorithms/metrics/closeness_centrality.adoc[Closeness Centrality]
*** xref:algorithms/metrics/eccentricity.adoc[Eccentricity]
*** xref:algorithms/metrics/geodesic_distance.adoc[Geodesic Distance]
*** xref:algorithms/metrics/clustering_coefficient.adoc[Clustering Coefficient]
*** xref:algorithms/metrics/core_numbers.adoc[Core Numbers]
*** xref:algorithms/metrics/profile.adoc[Profile]
*** xref:algorithms/metrics/wavefront.adoc[Wavefront]
*** xref:algorithms/metrics/bandwidth.adoc[Bandwidth]
** xref:algorithms/isomorphism/isomorphism_overview.adoc[Graph Isomorphism]
*** xref:algorithms/isomorphism/isomorphism.adoc[Isomorphism]
*** xref:algorithms/isomorphism/vf2_sub_graph_iso.adoc[VF2 Subgraph Isomorphism]
*** xref:algorithms/isomorphism/mcgregor_common_subgraphs.adoc[McGregor Common Subgraphs]
** xref:algorithms/planar/planar_graphs.adoc[Planar Graphs]
*** xref:algorithms/planar/boyer_myrvold.adoc[Boyer-Myrvold Planarity Test]
*** xref:algorithms/planar/planar_face_traversal.adoc[Planar Face Traversal]
*** xref:algorithms/planar/planar_canonical_ordering.adoc[Planar Canonical Ordering]
*** xref:algorithms/planar/straight_line_drawing.adoc[Chrobak-Payne Straight Line Drawing]
*** xref:algorithms/planar/is_straight_line_drawing.adoc[Is Straight Line Drawing]
*** xref:algorithms/planar/is_kuratowski_subgraph.adoc[Is Kuratowski Subgraph]
*** xref:algorithms/planar/make_connected.adoc[Make Connected]
*** xref:algorithms/planar/make_biconnected_planar.adoc[Make Biconnected Planar]
*** xref:algorithms/planar/make_maximal_planar.adoc[Make Maximal Planar]
** xref:algorithms/layout/layout_overview.adoc[Layout]
*** xref:algorithms/layout/topology.adoc[Topologies]
*** xref:algorithms/layout/random_layout.adoc[Random Graph Layout]
*** xref:algorithms/layout/circle_layout.adoc[Circle Layout]
*** xref:algorithms/layout/kamada_kawai_spring_layout.adoc[Kamada-Kawai Spring Layout]
*** xref:algorithms/layout/fruchterman_reingold.adoc[Fruchterman-Reingold Force Directed Layout]
*** xref:algorithms/layout/gursoy_atun_layout.adoc[Gürsoy-Atun Layout]
*** xref:algorithms/layout/layout_tolerance.adoc[Layout Tolerance]
** xref:algorithms/ordering/ordering_overview.adoc[Sparse Matrix Ordering]
*** xref:algorithms/ordering/cuthill_mckee_ordering.adoc[Cuthill-McKee Ordering]
*** xref:algorithms/ordering/king_ordering.adoc[King Ordering]
*** xref:algorithms/ordering/minimum_degree_ordering.adoc[Minimum Degree Ordering]
*** xref:algorithms/ordering/sloan_ordering.adoc[Sloan Ordering]
*** xref:algorithms/ordering/sloan_start_end_vertices.adoc[Sloan Start End Vertices]
** xref:algorithms/cycle_detection/cycle_detection_overview.adoc[Cycle Detection]
*** xref:algorithms/cycle_detection/hawick_circuits.adoc[Hawick Circuits]
*** xref:algorithms/cycle_detection/tiernan_all_cycles.adoc[Tiernan All Cycles]
*** xref:algorithms/cycle_detection/howard_cycle_ratio.adoc[Cycle Ratio]
** xref:algorithms/clique_detection/clique_detection_overview.adoc[Clique Detection]
*** xref:algorithms/clique_detection/bron_kerbosch.adoc[Bron-Kerbosch All Cliques]
** xref:algorithms/utility/utility_overview.adoc[Utility]
*** xref:algorithms/utility/copy_graph.adoc[Copy Graph]
*** xref:algorithms/utility/transpose_graph.adoc[Transpose Graph]
*** xref:algorithms/utility/transitive_closure.adoc[Transitive Closure]
*** xref:algorithms/utility/transitive_reduction.adoc[Transitive Reduction]
*** xref:algorithms/utility/smallest_last_ordering.adoc[Smallest Last Ordering]
*** xref:algorithms/utility/lengauer_tarjan_dominator.adoc[Lengauer-Tarjan Dominator Tree]
*** xref:algorithms/utility/metric_tsp_approx.adoc[Metric TSP Approximation]
*** xref:algorithms/utility/maximum_adjacency_search.adoc[Maximum Adjacency Search]
*** xref:algorithms/utility/bc_clustering.adoc[Betweenness Centrality Clustering]
*** xref:algorithms/utility/disjoint_sets.adoc[Disjoint Sets]
*** xref:algorithms/utility/incident.adoc[Incident]
*** xref:algorithms/utility/opposite.adoc[Opposite]
*** xref:algorithms/utility/neighbor_bfs.adoc[Neighbor BFS]
*** xref:algorithms/utility/loop_erased_random_walk.adoc[Loop-Erased Random Walk]
*** xref:algorithms/utility/graph_stats.adoc[Graph Statistics]
* xref:concepts/graph_concepts.adoc[Concepts]
** Graph Structure
*** xref:concepts/Graph.adoc[Graph]
*** xref:concepts/IncidenceGraph.adoc[Incidence Graph]
*** xref:concepts/BidirectionalGraph.adoc[Bidirectional Graph]
*** xref:concepts/AdjacencyGraph.adoc[Adjacency Graph]
*** xref:concepts/VertexListGraph.adoc[Vertex List Graph]
*** xref:concepts/EdgeListGraph.adoc[Edge List Graph]
*** xref:concepts/VertexAndEdgeListGraph.adoc[Vertex and Edge List Graph]
*** xref:concepts/AdjacencyMatrix.adoc[Adjacency Matrix]
*** xref:concepts/MutableGraph.adoc[Mutable Graph]
*** xref:concepts/VertexMutableGraph.adoc[Vertex Mutable Graph]
*** xref:concepts/EdgeMutableGraph.adoc[Edge Mutable Graph]
*** xref:concepts/PropertyGraph.adoc[Property Graph]
*** xref:concepts/MutablePropertyGraph.adoc[Mutable Property Graph]
*** xref:concepts/IteratorConstructibleGraph.adoc[Iterator Constructible Graph]
** Property and Value Types
*** xref:concepts/property_types/ColorValue.adoc[Color Value]
*** xref:concepts/property_types/Buffer.adoc[Buffer]
*** xref:concepts/property_types/BasicMatrix.adoc[Basic Matrix]
*** xref:concepts/property_types/Monoid.adoc[Monoid]
*** xref:concepts/property_types/KeyedUpdatableQueue.adoc[Keyed Updatable Queue]
*** xref:concepts/property_types/UpdatableQueue.adoc[Updatable Queue]
*** xref:concepts/property_types/PlanarEmbedding.adoc[Planar Embedding]
*** xref:concepts/property_types/PropertyTag.adoc[Property Tag]
* xref:generators/overview.adoc[Graph Generators]
** xref:generators/random.adoc[Random Graph Utilities]
** xref:generators/erdos_renyi_generator.adoc[Erdős-Rényi (Uniform Random)]
** xref:generators/rmat_generator.adoc[Scale-Free (R-MAT)]
** xref:generators/plod_generator.adoc[PLOD (Power Law)]
** xref:generators/small_world_generator.adoc[Small World (Watts-Strogatz)]
** xref:generators/mesh_generator.adoc[Mesh (2D Grid)]
** xref:generators/ssca_generator.adoc[SSCA (Clustered Benchmark)]
* xref:io/overview.adoc[Graph I/O]
** xref:io/graphviz.adoc[GraphViz (DOT)]
** xref:io/graphml.adoc[GraphML]
** xref:io/dimacs.adoc[DIMACS]
* xref:adaptors/overview.adoc[Graph Adaptors]
** xref:adaptors/filtered_graph.adoc[Filtered Graph]
** xref:adaptors/reverse_graph.adoc[Reverse Graph]
** xref:adaptors/subgraph.adoc[Subgraph]
** xref:adaptors/edge_list.adoc[Edge List]
** xref:adaptors/grid_graph.adoc[Grid Graph]
* xref:traits/overview.adoc[Traits and Iterators]
** xref:traits/graph_traits.adoc[Graph Traits]
** xref:traits/adjacency_list_traits.adoc[Adjacency List Traits]
** xref:traits/property_map.adoc[Property Map]
** xref:traits/property.adoc[property]
** xref:traits/iterators/adjacency_iterator.adoc[Adjacency Iterator]
** xref:traits/iterators/inv_adjacency_iterator.adoc[Inverse Adjacency Iterator]
* xref:exception.adoc[Exceptions]
* xref:extending/overview.adoc[Extending the BGL]
** xref:extending/constructing_algorithms.adoc[Worked Example: Graph Coloring]
** xref:extending/custom_storage.adoc[Custom Adjacency List Storage]
** xref:extending/leda_conversion.adoc[Adapting Existing Graph Structures]
* xref:about/overview.adoc[About]
** xref:about/design.adoc[Design Rationale]
** xref:about/graph_theory_review.adoc[Graph Theory Review]
** xref:about/bgl_named_params.adoc[Named Parameters]
** xref:about/bibliography.adoc[Bibliography]
** xref:about/history.adoc[History]
** xref:about/acknowledgements.adoc[Acknowledgements]
** xref:about/publications.adoc[Publications]
** xref:about/users.adoc[BGL Users]
* xref:faq.adoc[FAQ]
