Uploaded image for project: 'Giraph'
  1. Giraph
  2. GIRAPH-931

Provide a Strongly Connected Components algorithm

VotersWatch issueWatchersCreate sub-taskLinkCloneUpdate Comment AuthorReplace String in CommentUpdate Comment VisibilityDelete Comments
    XMLWordPrintableJSON

    Details

    • Type: Improvement
    • Status: Resolved
    • Priority: Minor
    • Resolution: Fixed
    • Affects Version/s: None
    • Fix Version/s: None
    • Component/s: examples
    • Labels:
      None

      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.

        Attachments

        1. GIRAPH-931.patch
          26 kB
          Gianluca Righetto
        2. GIRAPH-931.v2.patch
          27 kB
          Gianluca Righetto
        3. GIRAPH-931.v3.patch
          27 kB
          Gianluca Righetto

          Activity

            People

            • Assignee:
              Unassigned
              Reporter:
              gianluca Gianluca Righetto

              Dates

              • Created:
                Updated:
                Resolved:

                Issue deployment