The Parallel BGL builds on the Boost Graph Library (BGL) , offering similar data structures, algorithms, and syntax for distributed, parallel computation that the BGL offers for sequential programs. The Parallel BGL is intended primarily as a research platform, to facilitate both experimentation with and comparison of parallel graph algorithms and to provide solid implementations for solving large-scale graph problems in other application areas.

• Open-source implementation
• A high-performance parallel graph library for clusters
• Proven scalability to billions of edges on moderately-sized clusters
• Generic graph algorithms applicable to any domain involving graphs or networks

• Breadth-First Search
• Depth-First Search
• Eager Dijkstra's Shortest Paths
• Crauser et al.'s Shortest Paths
• Boruvka's Minimum Spanning Tree
• Dehne & Götz Minimum Spanning Tree
• Connected Components
• Strongly Connected Components
• PageRank
• Boman et al. Vertex Coloring
• Dinic's Max Flow
• Fruchterman-Reingold Force-Directed Layout

For more information on the Open Systems Lab, part of the Pervasive Technologies Laboratory at Indiana University, or Parallel BGL, see: http://www.osl.iu.edu/ or http://www.osl.iu.edu/research/pbgl/