Hadoop Map Reduce For Google web graph
A good question from Stackoverflow:
we have been given as an assignment the task of creating map reduce functions that will output for each node n in the google web graph list the nodes that you can go from node n in 3 hops. (The actual data can be found here: http://snap.stanford.edu/data/web-Google.html)
The answer on Stackover does not provide a solution (it is a homework assignment) but does walk though an explanation of using MapReduce for graph computations.
If you are thinking about using Hadoop for large graph processing, you are likely to find this very useful.