Recompute modularity
| Affects | Status | Importance | Assigned to | Milestone | |
|---|---|---|---|---|---|
| igraph |
New
|
Wishlist
|
Unassigned | ||
Bug Description
This is not a bug, but a suggestion for future releases.
When using meta-heuristic optimization (simulated annealing, for example), it is common to have a very large number of calls to igraph_modularity for the same network after a few modifications in the membership vector. However, for large networks this implies in high execution times for the optimization due to the modularity computation for the whole network at each algorithm iteration.
Since most nodes remain untouched from call to call of the igraph_modularity in this case, a function to recompute modularity that considers only the modifications done in the membership vector of a given network, instead of recomputing the whole thing, could greatly improve performance in such kind of optimization.
Thanks
Luiz
| Changed in igraph: | |
| importance: | Undecided → Wishlist |
| milestone: | none → 0.7 |
| Gábor Csárdi (gabor.csardi) wrote Continue on github | #1 |
The development of igraph has moved to github, so please do not comment on this bug here. You are of course welcome to comment on github, here:
https:/