On Oct 16, 2008, at 3:09 PM, Bhupesh Bansal wrote:
Lets say I want to implement a DFS in my graph. I am not able to picturise implementing it with doing graph in pieces without putting a depth bound to(3-4). Lets say we have 200M (4GB) edges to start with
Start by watching the lecture on graph algorithms in map/reduce: http://www.youtube.com/watch?v=BT-piFBP4fE And see if that makes it clearer. If not, ask more questions. *smile* -- Owen
