搜索资源列表
algorithm-for-betweenness-centrality
- 社交网络中一些点是中枢点,这些点在社交网络中占有重要地位,但是计算结点连接度的复杂度比较高,这篇论文主要做了改进算法效率的工作-Social network is the central point of some points, these points in the social network plays an important role, but the computing nodes connected relatively high degree of complexity, th
Centrality-measures
- 文件包括:1.计算平均最短路径;2.计算每个顶点相邻节点的平均度;3.计算每个节点的邻近中心度;4.计算节点的介数(slow);5.计算节点的介数(faster);6.计算每条边的介数值;7.快速迪杰斯特拉算法;8.经典迪杰斯特拉算法。-1.the average shortest path in the graph 2.the average degree of neighboring nodes for every vertex 3.computes the closeness centra