Hi,
We have graph data such that subsets of edges and vertexes occur multiple times in the same configuration however these sub graph matches occur rather infrequently. Would Giraph be a good tool to find these subsets, if so how would one go about implementing the algorithm? Phil
