搜索资源列表
prim_kruskal_matlab6.5
- prim算法 kruskal算法用matlab实现 输入标准：x邻接矩阵 p节点集 输出：生成树边集 G
复杂网络邻接矩阵直接转化为Pajek
- 一个可以把Matlab复杂网络邻接矩阵直接转化为Pajek可以识别的网络文件（.net）很实用，学习复杂网络的可以下载-a programme that can transform the adj_matrix in matlab into .net file that pajek can recognize
dongtaiguihua.rar
- 用动态规划求解最短路问题的MATLAB程序。需输入带权邻接矩阵，输出为最短路径和最短路长。,Dynamic Shortest Path Problem Solver of the MATLAB program. Required to enter the weighted adjacency matrix, the output for the shortest path and shortest path length.
incandadf
- 实现关联矩阵与邻接矩阵相互转化的matlab代码-Correlation matrix and adjacency matrix to achieve mutual transformation of matlab code
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.
topnology
- MATLAB做网络优化，先生成一个随机的邻接矩阵，然后画出改图。-MATLAB to do network optimization, sir into a random adjacency matrix, and then draw the reform plan.
2
- 一种求邻接矩阵的普通算法，这是通用程序，要注意变量的更改。-A Method for the adjacency matrix of the general algorithm, which is common procedure, to pay attention to the variable changes.
mintreePrim
- Dandn文件给出了输入参数的名称及格式 即在调用prim前先输入邻接矩阵D和节点个数n 输入prim 得到两行的矩阵T,将上下两行数字对应的节点相连即可-Dandn document gives the name of the input parameters and format Prim in the call prior to the importation of adjacency matrix D and the node number n Input pri
pajek
- 一个可以把Matlab复杂网络邻接矩阵直接转化为Pajek可以识别的网络文件（.net）很实用，学习复杂网络的可以下载-a programme that can transform the adj_matrix in matlab into .net file that pajek can recognize
Floyd-Matlab
- floyd算法的matlab程序 floyd-最短路问题 输入： B-邻接矩阵(bij)，指i到j之间的距离，可以是有向的。 sp- 起点标号。 ep- 终点标号。 输出： d- 最短路的距离。 path-最短路的路径。-floyd algorithm matlab program floyd-shortest path problem Input: B-adjacency matrix (bij), refers to the distan
Dijkstra-matlab
- 求第一个城市到其它城市的最短路径.用矩阵（为顶点个数）存放各边权的邻接矩阵，行向量、、、分别用来存放标号信息、标号顶点顺序、标号顶点索引、最短通路的值-The first city to find the shortest path to other cities. With a matrix (for the number of vertices) records of the right side of the adjacency matrix, row vector, were used
Dijkstra
- 图与网络论中求最短路径的Dijkstra算法 M-函数 格式 [S,D]=minroute(i,m,W) i为最短路径的起始点,m为图顶点数,W为图的带权邻接矩阵， 不构成边的两顶点之间的权用inf表示。显示结果为：S的每 一列从上到下记录了从始点到终点的最短路径所经顶点的序号； D是一行向量，记录了S中所示路径的大小 -Graph and network theory Dijkstra' s shortest path algorithm M-functio
adjacency matrix
- matlab程序，其功能为将邻接表转换为邻接矩阵，非常方便。(Matlab program, its function is to convert adjacency table to adjacency matrix, very convenient.)
JUDGE
- 判断两个邻接矩阵是否为同构图，1表示是同构图，0表示不是(Determine whether two adjacency matrices are isomorphic graphs, 1 are isomorphic graphs, and 0 are not.)
matlab-Txt_convert_to_AdjMatrix
- 以美国航空网数据集为例 将txt文件中的数据集改为--邻接矩阵--形式进行保存 转换结果为无向、无权图 a为节点个数 为了执行简单，函数没有设置参数，大家直接在程序里改参数a的值(Turn the edge list into a adjacency matrix)
suijitu1
- 复杂网络随机图生成，并生成邻接矩阵。运用MATLAB实现。(The random graph of complex network is generated and the adjacency matrix is generated.)
单源点最短路径—Dijkstra（迪杰斯特拉）算法
- MATLAB迪杰特斯拉源程序，用于在给出邻接矩阵求单元点点之间的距离(MATLAB Di Jester Tesla source program, used to give the adjacency matrix to find the distance between elements.)
code
- 复杂网络相关参数的代码，度与度分布，平均路径长度，聚类系数，中心性，邻接矩阵与邻接表转换等(Code, degree and degree distribution, average path length, clustering coefficient, centrality, transformation between adjacency matrix and adjacency table of complex network related parameters, etc.)
基于蚁群算法的机器人路径规划MATLAB源码收藏
- 基于蚁群算法的机器人路径规划MATLAB源码，使用网格离散化的方法对带有障碍物的环境建模，使用邻接矩阵存储该环境，使得问题转化为蚁群算法寻找最短路径。(Robot path planning MATLAB source code based on ant colony algorithm, using grid discretization method to model the environment with obstacles, using adjacency matrix to stor