10 Overview  section in |Logo| Parallel Boost Graph Library
104 .. |Logo| image:: pbgl-logo.png
109 .. _Parallel Dijkstra example: dijkstra_example.html
110 .. _Boost Graph Library: http://www.boost.org/libs/graph/doc
111 .. _adjacency_list: http://www.boost.org/libs/graph/doc/adjacency_list.html
112 .. _local subgraph adaptor: local_subgraph.html
113 .. _vertex list graph adaptor: vertex_list_adaptor.html
114 .. _MPI: http://www-unix.mcs.anl.gov/mpi/
115 .. _generic programming: http://www.cs.rpi.edu/~musser/gp/
116 .. _development page: design/index.html
117 .. _process groups: process_group.html
118 .. _MPI process group: process_group.html
119 .. _Simple trigger interface: simple_trigger.html
120 .. _Open Systems Laboratory: http://www.osl.iu.edu
121 .. _Indiana University: http://www.indiana.edu
122 .. _Distributed adjacency list: distributed_adjacency_list.html
123 .. _Distributed queue: distributed_queue.html
124 .. _Distributed property map: distributed_property_map.html
125 .. _R-MAT generator: rmat_generator.html
126 .. _Sorted R-MAT generator: sorted_rmat_generator.html
127 .. _Sorted Unique R-MAT generator: sorted_unique_rmat_generator.html
128 .. _Unique R-MAT generator: unique_rmat_generator.html
129 .. _Scalable R-MAT generator: scalable_rmat_generator.html
130 .. _Erdos-Renyi generator: http://www.boost.org/libs/graph/doc/erdos_renyi_generator.html
131 .. _Sorted Erdos-Renyi generator: http://www.boost.org/libs/graph/doc/sorted_erdos_renyi_gen.html
132 .. _Small world generator: http://www.boost.org/libs/graph/doc/small_world_generator.html
133 .. _SSCA generator: ssca_generator.html
134 .. _Mesh generator: mesh_generator.html
135 .. _Breadth-first search: breadth_first_search.html
136 .. _Depth-first search: tsin_depth_first_visit.html
137 .. _Dijkstra's single-source shortest paths: dijkstra_shortest_paths.html
138 .. _Eager Dijkstra shortest paths: dijkstra_shortest_paths.html#eager-dijkstra-s-algorithm
139 .. _Crauser et al. Dijkstra shortest paths: dijkstra_shortest_paths.html#crauser-et-al-s-algorithm
140 .. _Delta-Stepping shortest paths: dijkstra_shortest_paths.html#delta-stepping-algorithm
141 .. _Minimum spanning tree: dehne_gotz_min_spanning_tree.html
142 …uvka's minimum spanning tree: dehne_gotz_min_spanning_tree.html#dense-boruvka-minimum-spanning-tree
143 …ocal minimum spanning forests: dehne_gotz_min_spanning_tree.html#merge-local-minimum-spanning-trees
144 .. _Boruvka-then-merge: dehne_gotz_min_spanning_tree.html#boruvka-then-merge
145 .. _Boruvka-mixed-merge: dehne_gotz_min_spanning_tree.html#boruvka-mixed-merge
146 .. _PageRank: page_rank.html
147 .. _Boman et al. Graph coloring: boman_et_al_graph_coloring.html
148 .. _Connected components: connected_components.html
149 .. _Connected components parallel search: connected_components_parallel_search.html
150 .. _Strongly-connected components: strong_components.html
151 .. _Distributed Graph: DistributedGraph.html
152 .. _Distributed Vertex List Graph: DistributedVertexListGraph.html
153 .. _Distributed Edge List Graph: DistributedEdgeListGraph.html
154 .. _Global Descriptor: GlobalDescriptor.html
155 .. _METIS Input: metis.html
156 .. _architectural overview: overview.html
157 .. _Fruchterman Reingold force-directed layout: fruchterman_reingold.html
158 .. _s-t connectivity: st_connected.html
159 .. _Betweenness centrality: betweenness_centrality.html
160 .. _Non-distributed betweenness centrality: non_distributed_betweenness_centrality.html