-
Notifications
You must be signed in to change notification settings - Fork 4
Stanford SNAP
- 4 functions related to communities
- analysing the networks
- visualising the networks
- applying community detection algorithms to the networks
-
Description
Uses the Clauset-Newman-Moore community detection method for large networks. At every step of the algorithm two communities that contribute maximum positive value to global modularity are merged. Fills CmtyV with all the communities detected and returns the modularity of the network.
-
Description
Uses the Girvan-Newman community detection algorithm based on betweenness centrality on Graph. Fills CmtyV with all the communities detected and returns the modularity of the network.
-
Description
Returns the number of reciprocal edges between the nodes in NIdV and the number of edges between the nodes in NIdV and the rest of the graph.
-
Description
Computes the modularity score of a set of node ids NIdV in Graph. The function runs much faster if the number of edges in Graph is provided in the optional GEdges parameter.
Literature Survey | Data | Algorithms | Plan | Meetings Journal
© Copyright 2016 Sergiu Tripon. All Rights Reserved.