Subject: [boost] [PBGL] Distributed BFS example : input and outpu
From: Sandeep Gupta (gupta.sandeep_at_[hidden])
Date: 2009-10-26 02:47:13
I am trying to understand how the example
libs/graph_parallel/example/breadth_first_search.cpp works. I am not able to
understand (neither find any documentation for it) the input and output of
To the best of my understanding a valid input to this program is graph/test/
What's the format for the input.
And why does the output of BFS dependent upon the number of process in the
Would greatly appreciate any explanation or relevant pointers.
Boost list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk