posted Jul 5, 2016, 7:56 AM by Steve Borgatti
[
updated Jul 5, 2016, 9:32 AM
]
 Added exact keyplayer routine to the CLI. The procedure finds the best set of k nodes which, if removed from the network, would maximize the extent of fragmentation (as measured by the number of pairs of nodes that can't reach each other by any path). The algorithm is brute force: it checks all possible subsets of size k. As a result, it is only appropriate for small networks and small k. For example, it can solve N=50 and K=3 in a few seconds, but N=100 and K=3 takes several minutes. Syntax is exhaustivekp(<dataset> <k>), such as:
>dsp exhaustivekp(zackar 3)
 Installer package contains version 2.160 of NetDraw, which changes the way the Width checkbox on the Rels tab works. Before, the width of the line between two nodes was determined by the average tie strength of all tie types currently active. Now, the width is determined by the largest tie strength of any currently active types of tie between that pair of nodes.

