[Boost-users] Details of boost parallel graph implementation

Subject: [Boost-users] Details of boost parallel graph implementation
From: Mayank Bakshi (mayank.bakshi_at_[hidden])
Date: 2015-07-29 04:26:28

 Hello,

I am working on mpi implementation of boost for breadth first search. 
What is the algorithmic detail for BFS in boost.mpi? How the graph is processed by each rank which we provide in mpirun (load distribution among different processes)? 


Thanks & Regards
Mayank Bakshi
Tata Consultancy Services Limited
Cell:- 7083955990
Mailto: [e-mail]
Website: http://www.tcs.com
____________________________________________
Experience certainty.	IT Services
			Business Solutions
			Consulting
____________________________________________

=====-----=====-----=====
Notice: The information contained in this e-mail
message and/or attachments to it may contain 
confidential or privileged information. If you are 
not the intended recipient, any dissemination, use, 
review, distribution, printing or copying of the 
information contained in this e-mail message 
and/or attachments to it are strictly prohibited. If 
you have received this communication in error, 
please notify us by reply e-mail or telephone and 
immediately and permanently delete the message 
and any attachments. Thank you