Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Given a node in a graph that is reachable, how do you find all the nodes that are reachable ? How would you enable parallel computation of this information ? Given a number of cores, how many threads would you choose ?
For the first part, i would go with the Breadth first Search and second part, i think somehow i should use the strnegth of Map-reduce but not able to understand how?
Could you please help. Appreciate your time and efforts.
There is a worked out example in the article: breadth-first graph search using an iterative map-reduce algorithm