fg.cc: Connected components of a graph

In flashxio/FlashGraphR: Massive Graph Analysis

Description

Compute all (weakly or strongly) connected components of a graph.

Usage

fg.clusters(graph, mode = c("weak", "strong"))

Arguments

graph	The FlashGraph object
mode	Character string, either "weak" or "strong". For directed graphs "weak" implies weakly, "strong" strongly c components to search. It is ignored for undirected graphs.

Details

For an undirected graph, this function only computes connected components and ignores the argument ‘mode’.

For strongly connected components, we use a customized version of the algorithm described in the paper

Sungpack Hong, Nicole C. Rodia, Kunle Olukotun, On Fast Parallel Detection of Strongly Connected Components (SCC) in Small-World Graphs, Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, 2013

Value

A numeric vector that indicates the cluster id to which each vertex blongs to.

Author(s)

Da Zheng <[e-mail]>

References

Sungpack Hong, Nicole C. Rodia, Kunle Olukotun, On Fast Parallel Detection of Strongly Connected Components (SCC) in Small-World Graphs, Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, 2013

flashxio/FlashGraphR documentation built on May 8, 2019, 11:11 p.m.