[GIRAPH-931] Provide a Strongly Connected Components algorithm

• Type: Improvement
• Status: Resolved
• Priority: Minor
• Resolution: Fixed
• Component/s: examples
• Assignee: Unassigned
• Reporter: Gianluca Righetto
• Created: 19/Jul/14 17:46
• Updated: 10/Oct/14 19:59
• Resolved: 10/Oct/14 19:59

Description

Provide an implementation of an algorithm for finding strongly connected components in a graph to augment the giraph-examples library. This has been initially proposed on GSoC'14.
A handful of graph algorithms have been researched in this paper: "Optimizing Graph Algorithms on Pregel-like Systems" (Salihoglu, S., Widom, J., 2014), and a detailed explanation of SCC can also be found in it.