Description Usage Arguments Details Value Author(s) References
Compute all (weakly or strongly) connected components of a graph.
1 | fg.clusters(graph, mode = c("weak", "strong"))
|
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. |
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
A numeric vector that indicates the cluster id to which each vertex blongs to.
Da Zheng <dzheng5@jhu.edu>
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
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.