You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Oct 18, 2021. It is now read-only.
I tried some cluster algorithm and generate cluster id for each vertex. Now I need to compute betweenness centrality of on each cluster(because the whole graph is too large). But I do not know how to generate subgraphs according to the cluster ids, and how could I compute betweenness centrality in parallel on each subgraph.
Would you please tell me how could I make this work?
The text was updated successfully, but these errors were encountered:
I tried some cluster algorithm and generate cluster id for each vertex. Now I need to compute betweenness centrality of on each cluster(because the whole graph is too large). But I do not know how to generate subgraphs according to the cluster ids, and how could I compute betweenness centrality in parallel on each subgraph.
Would you please tell me how could I make this work?
If you have generated cluster if for each vertex, you can get subgraph using Graphx's subgraph interface:
Hi,
Thanks for this great work!!
I tried some cluster algorithm and generate cluster id for each vertex. Now I need to compute betweenness centrality of on each cluster(because the whole graph is too large). But I do not know how to generate subgraphs according to the cluster ids, and how could I compute betweenness centrality in parallel on each subgraph.
Would you please tell me how could I make this work?
The text was updated successfully, but these errors were encountered: