Skip to content
This repository has been archived by the owner on Oct 18, 2021. It is now read-only.

[Question] how could I split the graph into subgraphs according to cluster id? #125

Closed
CoinCheung opened this issue Aug 19, 2021 · 2 comments

Comments

@CoinCheung
Copy link

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?

@wey-gu
Copy link
Contributor

wey-gu commented Aug 29, 2021

@Nicole00 could you please help with this?
Thanks!

@Nicole00
Copy link
Contributor

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?

If you have generated cluster if for each vertex, you can get subgraph using Graphx's subgraph interface:

graph.subgraph(vpred)

Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Labels
None yet
Projects
None yet
Development

No branches or pull requests

3 participants