marcolotz/giraphbfsso

A Giraph implementation of Breadth-First Search, structure oriented

giraphbfsso's Issues

Depth First Search

Hi Marco

I apologize in advance for creating a ticket to actually ask you a question. But I could not find your email address and wanted to reach out to you.

I came across your post on StackOverflow and wanted to ask you for additional questions:
http://stackoverflow.com/questions/12253794/breadth-first-implentation-in-giraph-graphchi-or-pregel

I am looking for tips on how to leverage Giraph for the use case below:

I have a list of Nodes.
A Node is a collection of Key-Value pairs.
2 Nodes are related (have an edge) if they share a Key-Value pair.

Until now I have been running a Depth First Search algorithm to cluster the Nodes into Connected Components.

However, my data set has grown significantly and I need to scale. This is the reason that brought me to Giraph.

Please would it be possible for you to give me some pointers on how I can leverage depth first search on Giraph to solve the use case above?
Alternatively someone on the Giraph mailing list wrote that maybe it would be better if I use mapreduce first such that in the map phase each key-value pair at a node is a key and the node is the value. This way I would get the first level of connections at the reduce-keys. Then I could use the output of reduce phase as adjacency list for the graph to be processed using Giraph.

I would greatly appreciate any help.
Thank you in advance.
-matt