The Parallel Boost Graph Library is an extension to the Boost Graph Library (BGL) for parallel and distributed computing. It offers distributed graphs and graph algorithms to exploit coarse-grained parallelism along with parallel algorithms that exploit fine-grained parallelism, while retaining the same interfaces as the (sequential) BGL. Code written using the sequential BGL should be easy to parallelize with the parallel BGL. Visitors new to the Parallel BGL should read our architectural overview.
- Graphviz output
- METIS input
- Distributed algorithms
- Breadth-first search
- Dijkstra's single-source shortest paths
- Depth-first search
- Minimum spanning tree
- Connected components
- Boman et al. Graph coloring
- Fruchterman Reingold force-directed layout
- s-t connectivity
- Betweenness centrality
- Non-distributed betweenness centrality
Copyright (C) 2005-2009 The Trustees of Indiana University.
Authors: Nick Edmonds, Douglas Gregor, and Andrew Lumsdaine