计算复杂网络中的节点或边的介数中心性，基于python的复杂网络工具箱-Betweenness centrality computational complexity of the network nodes or edges, based on a complex network toolbox python

复杂网络中基础参数编程，如求边介数的程序-A complex network of edge betweenness program

Market Newman写的复杂网络的加权GN算法 算法用Python写的 其基本思想是不断的删除网络中具有相对于所有源节点的最大的边介数(ege betweenness)的边，然后，再重新计算网络中剩余的边的相对于所有源节点的边介数-The basic idea is to delete the network with respect to all of the source nodes of the largest betweenness (EGE betweenness) edge