++ed by:

1 PAUSE user
1 non-PAUSE user.

Author image Darko Obradovic
and 1 contributors


A toolkit for Social Network Analysis
Calculate betweenneess values for all nodes
identify network components
calculate core collapse sequences (CCS)
implementation of Kleinberg's HITS algorithm
identifies communities with the Louvain-method developed by Blondel and Guillaume and Lamboitte and Lefebvre
implementation of the PageRank algorithm
Community class for SNA::Network
Community structure class for SNA::Network
Edge class for SNA::Network
load and save networks from/to Guess .gdf files
load and save networks from/to Pajek .net files
Generate random networks by density
Generate random networks according to the configuration model
Generate random networks by a series of edge swaps according to the Markov Chain Monte Carlo principle
Node class for SNA::Network
Test plugin for SNA::Network::Node
Test plugin for SNA::Network