I want to plot a community graph but after removing the smallest
communities.
Since I already have the "communities" object from the original (entire)
graph, I hope I can use it to filter the subgraph (without running the
community detection algorithm again on the subgraph). But of course it
could be easier to run the algorithm again.
This is the work-flow I thought to apply (but of course it could be
totally wrong):
graph -> fastgreedy.community(graph) -> communities ->
induced.subgraph(graph's members of communities>20)
-> subgraph -> contract.vertices(based on membership) ->
large_communities_graph -> plot(large_communities_graph)
Il 24.11.2013 21:52 Gábor Csárdi ha scritto:
I am missing something. So you want to remove vertices from the
community graph, or from the original graph?
G.
_______________________________________________
igraph-help mailing list
[email protected]
https://lists.nongnu.org/mailman/listinfo/igraph-help
