Code and Data Repository for On Interdicting Dense Clusters in a Network
提供了论文“网络密集集群阻断”的源代码和数据集，包含20个随机网络和38个真实网络，每个文件描述了顶点权重、阻断成本及边阻断成本。
Source codes and data set used in “On interdicting dense clusters in a network” paper. Data set contains 20 randomly-generated networks and 38 real-life networks. Each file contains 1+X+Y lines, where X and Y are the number of vertices and the number of edges in the network, respectively. It starts with two numbers indicating the number of vertices X and the number of edges Y. Then, it follows with X lines of two numbers. Note that we do not assign indices to the vertices. The index of a vertex is the same as the line number it appears on. The first number in each line is the weight of a vertex and the second number is its blocking cost. The last Y lines contain three numbers. The first and second numbers in each line are the head and the tail of an edge. Note that the edges are undirected. The third number is the blocking cost of an edge.