搜索资源列表
Clustering_Coefficient
- 根据邻接矩阵计算网络的聚类系数。输入为邻接矩阵输出为整个网络的聚类系数-cluster coefficient
Clustering_Coefficient
- 根据邻接矩阵，计算复杂网络中模块的聚类系数。-According to the adjacency matrix, the computational complexity of the network module clustering coefficients.
get_clustering_coefficient
- 通过邻接矩阵，计算网络的聚类系数。聚类系数是复杂网络中一个重要参量。 -Through the adjacency matrix, computing networks, clustering coefficient. Clustering coefficient is a complex network, an important parameter.
get_shortest_paths
- 通过定义邻接矩阵，计算节点之间的最短路径长度-By defining the adjacency matrix to calculate the shortest path between node length
ngldMatrix
- 邻接灰度矩阵（NGLDM）计算的程序，matlab实现-Neighboring Gray-Level Dependence Matrix
EfficiencyofNetworks
- 计算网络效率，输入参数，网络的邻接矩阵，输出任意节点对间的效率，及网络效率。 设计思路：floyd算法求最短路径，求倒数，求平均值-Computing network efficiency, input parameters, the network' s adjacency matrix, any node between the output efficiency, and network efficiency. Design ideas: floyd shortest path
Floyd
- Floyd算法的matlab实现。对输入的邻接距离矩阵计算图中任意两点间的最短距离矩阵和路由矩阵，且能查询任意两点间的最短距离和路由。并根据结果自动绘制出了最短路径图。 程序中使用了前向路由和回溯路由两种方法，并对于无向图进一步减小算法复杂度。-Matlab implementation of the Floyd algorithm. Adjacent input distance matrix between any two points in calculating the figur
YIQUN
- 遗传算法计算最短圈MATLAB算法，矩阵C是邻接矩阵，NC是迭代次数。-Genetic algorithm for computing the shortest path
floyd
- 利用MATLAB实现Floyd算法，可对输入的邻接距离矩阵计算图中任意两点间的最短距离矩阵和路由矩阵，且能查询任意两点间的最短距离和路由。-Floyd algorithm using MATLAB realize, can be routed to the shortest distance adjacency matrix and the distance matrix calculation map between any two points in the input matrix, an
code
- 复杂网络基于邻接矩阵计算网络各参数的常用程序-Complex network computing network adjacency matrix based on the parameters of common procedures
ISMModel
- 解释结构模型(ISM)的matlab学习程序，通过输入邻接矩阵及其维数，计算出因素的分级，以及可达集、先行集和共同集。-Interpretative Structural Model (ISM) in matlab learning program, by entering the adjacency matrix and its dimension, calculate grading factors, as well as arrive set, first set and a common
BetweennessVerte
- 根据邻接矩阵，计算复杂网络中节点的介数。(According to adjacency matrix, Calculate the Betweenness of network nodes)
介数度数计算程序
- 首先计算邻接矩阵，然后计算介数，度数，需要准备网络的边和节点信息(First, the adjacency matrix is computed, and then the median and degree are computed.)