文件名称:gn
介绍说明－－下载内容来自于网络，使用问题请自行百度
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) edges, then re computing network the remaining edge relative to the boundary of the source node number of all
其基本思想是不断的删除网络中具有相对于所有源节点的最大的边介数(ege betweenness)的边，然后，再重新计算网络中剩余的边的相对于所有源节点的边介数-The basic idea is to delete the network with respect to all of the source nodes of the largest betweenness (EGE betweenness) edges, then re computing network the remaining edge relative to the boundary of the source node number of all
(系统自动生成,下载前可以参看下载内容)
下载文件列表
community/cmty.py
community/graph.txt
community/README
pax_global_header
community
community/graph.txt
community/README
pax_global_header
community
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者，仅为网络服务对象提供信息存储空间，仅对用户上载内容的表现方式做保护处理，对上载内容本身不做任何修改或编辑。