algorithm-of-minimum-cut-sets

代码说明：

  求最小割集的近似算法，具有近似性的保证，可用于社会网络的分析以及求图的最小割集。(trives for the approximate algorithm of minimum cut sets, with approximate guarantee, can be used for the analysis of social networks and strives for the minimum cut set of the graph.)

文件列表：

algorithm of minimum cut sets
.............................\5
.............................\.\graph5.txt,4471657,2015-05-04
.............................\compute.cpp,3085,2015-05-07
.............................\compute.dsp,3413,2015-05-07
.............................\compute.dsw,539,2015-05-07
.............................\compute.ncb,50176,2015-05-07
.............................\compute.opt,48640,2015-05-07
.............................\compute.plg,248,2015-05-07
.............................\Debug
.............................\.....\compute.exe,180311,2015-05-07
.............................\.....\compute.ilk,254836,2015-05-07
.............................\.....\compute.obj,12103,2015-05-07
.............................\.....\compute.pch,2035292,2015-05-03
.............................\.....\compute.pdb,517120,2015-05-07
.............................\.....\vc60.idb,82944,2015-05-07
.............................\.....\vc60.pdb,102400,2015-05-07
.............................\define.h,844,2015-05-03
.............................\graph5.txt,731521,2015-05-07
.............................\graph6.txt,1117350,2015-05-07
.............................\init2.h,1825,2015-04-28