ParGraph is a generic parallel graph library. It is comparable with Boost Graph Library (BGL). Like the BGL it uses C++ templates and the visitor concept to generically implement graph algorithms. Whereas the BGL is sequential, ParGraph supports parallelism in terms of distributed graphs and parallel algorithms, like breadth first search, which can be adapted to the user's needs. First applications (like max-flow in different implementations) show how the library can be used. ParGraph relies on property concept of Boost and extends it for the distributed storing. The communication between the processors holding parts of the graph is realized with Message Passing Interface (MPI) so that portability guaranteed. Although the communication is encapsulated, all aspect of parallelism cannot be hidden from the user. There is no limitation to platforms and no other software than Boost and MPI, which are both freely available, is used.
For details on classes and functions in ParGraph see
Florian Hielscher and Peter Gottschling