搜索资源列表
DijkstraMatlab
- 最大邻接点存储的单元最短路径算法,在一个网络中,各结点的邻接接点的最大值称为该网络的最大邻接结点数。取网络的最大邻接结点数作为矩阵的列,网络的结点总数作为矩阵的行,构造邻接结点矩阵M-PJ来描述网络结构,邻接结点矩阵的行按结点号从小到大顺序排列,与结点I邻接的结点号写在矩阵的第I行,如果结点I的邻接点数小于最大邻接点数,则以0填充,直到填满为止。对照邻接结点矩阵,把邻接结点矩阵中各元素邻接关系对应边的权值填在同一位置上,构造相应的初始判断矩阵M-PDJ。根据邻接结点矩阵和初始判断矩阵,就可以求网
Powerlaw_with_Expected_Exponent
- 复杂网络complex network 生成幂律分布的网络矩阵或者邻接矩阵
isomorphism88.m
- 只要输入两个对应平面运动链的邻接矩阵,就能对他们进行同构判别!-Just enter two planar kinematic chain corresponding adjacency matrix, we can determine the isomorphism on them!
SIS-20150719
- 本程序是稀疏矩阵(三列)的SIS模型,用于上万个节点的大型网络。因为传统的算法是基于邻接矩阵,对于大型网络并不适用。-This procedure is sparse (three) of the SIS model for large-scale network of tens of thousands of nodes. Because the traditional algorithm is based on adjacency matrix, does not apply to larg
Sparse-Matrix-SIS
- 传统的算法是基于邻接矩阵对网络指标进行计算,而大型网络通过稀疏矩阵保存。本研究编写了可以计算稀疏矩阵的经典传染病SIS模型的程序。-The traditional method is based on network indicators adjacency matrix computing, and large networks through sparse matrix saved. The study prepared by the epidemic SIS model can calcu