搜索资源列表
homework_da
- 初学者设计的matlab顶点问题着色问题gui解决，要求输入顶点个数，可计算色多项式，及染色方法-Matlab beginners designed gui question vertex coloring problem resolved for the importation of the number of vertices, chromatic polynomial computable, and staining
triangulation_order6_boundary_node
- 有限元方法分析典型结构,采用六节点三角形单元-This programming give an order 6 triangulation, an abstract list of sets of six nodes. The vertices are listed clockwise, then the midside nodes.
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
betweenness_centrality
- 关于复杂网络中的Betweenness，用matlab计算。-betweenness_centrality(A) returns the betweenness centrality for all vertices in A.
clustering_coefficients
- 关于复杂网络的聚类系数算法，用matlab计算，矩阵为稀疏矩阵。-clustering_coefficients(A) returns the clustering coefficients for all vertices in A. The clustering coefficient is the ratio of the number of edges between a vertex s neighbors to the total possible number of edges
matlab
- FDTD的功能实现，含有中文注释，设置吸收边界和顶点-FDTD realization of the function containing Chinese notes, absorbing boundary and vertices
kevin
- 包含部分obj文件 有几个在matlab环境下水印制作的小程序 有用matlab读入三维网格并显示并对读入顶点进行排序。有傅里叶变换-There are several obj file contains part in the matlab environment watermarking small program useful for three-dimensional grid matlab reads and reads and displays the sorted vertices
MATLAB-floyd
- Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。(The Floyd algorithm, also called the Freud algorithm and the insertion point method, is an algorithm for finding the shortest path between the vertices in a given weighted graph.)