搜索资源列表
2n-2n
- 本Matlab代码是检验一个有向图是否是一个弱距离正则图-The Matlab code is to test a directed graph is a weak distance-regular graph
Dijkstra
- Demonstration of Dijkstra s Minimum Distance Algorithm: DIJKSTRA is a MATLAB program which runs a simple demonstration of Dijkstra s algorithm for determining the minimum distance from one node in a graph to all other nodes. The program is mainly o
Floyd
- Shortest Distances Between Nodes in a Directed Graph:(with test problems and out puts) FLOYD is a MATLAB library which demonstrates Floyd s algorithm for finding the shortest distance between every pair of nodes in a directed graph.
undirectedgraph
- 建立了无向图结构完成了图的遍历与最短距离与最优路径的寻找-Established a complete undirected graph structure graph traversal with the shortest distance and find the optimal path
sds
- 通过一个图的权值矩阵求出它的每两点间的最短路径矩阵。 从图的带权邻接矩阵A=[a(i,j)] n×n开始，递归地进行n次更新，即由矩阵D(0)=A，按一个公式，构造出矩阵D(1)；又用同样地公式由D(1)构造出D(2)；……；最后又用同样的公式由D(n-1)构造出矩阵D(n)。矩阵D(n)的i行j列元素便是i号顶点到j号顶点的最短路径长度，称D(n)为图的距离矩阵，同时还可引入一个后继节点矩阵path来记录两点间的最短路径。-By weight of a graph in which eac
Dijkstra
- 计算无向图中，从某一点出发到其余各点距离之和的最小值。应用Dijkstra算法完成。输入格式为，先输入两个数字N和M，N为顶点个数；之后输入M行数据，每行数据为两个顶点号以及顶点之间的距离。-Calculating an undirected graph, starting from a point to the rest of the points and the minimum distance. Application of Dijkstra' s algorithm is comp
folyd
- 1.求所有点对的最短路径问题，设G=(V,E)是一个有向图，其中的每条边(i,j)由一个非负的长度l[i,j]，如果从顶点i到顶点j没有边，则l[i,j]=∞。要找出从每个顶点到其他所有顶点的距离，这里从顶点x到顶点y的距离是指从x到y的最短路径的长度。 2. 通过一个图的权值矩阵求出它的每两点间的最短路径矩阵。 3. 从图的带权邻接矩阵A=[a(i,j)] n×n开始，递归地进行n次更新，即由矩阵D(0)=A，按一个公式，构造出矩阵D(1)；又用同样地公式由D(1)构造出D(2)；……
dijkstra_CPP
- 图论中的最短距离算法dijkstra，基于C++实现，对于数学建模有很大帮助。-The shortest distance between graph theory algorithms dijkstra, based on C++ implementation, for mathematical modeling of great help.
Cgrafsuanfa
- 图论常用求最短距离算法，数组线性查找算法，VC++实现-Graph theory used for the shortest distance algorithm, an array linear search algorithm, VC++ achieve
matlab-bgl-master
- matlab-bgl工具包，包含matlab图论里边大部分的文件，点度数、边介数、最短距离、聚类系数-matlab-bgl toolkit contains matlab graph theory inside most of the file, click degrees, while the number of referrals, the shortest distance, clustering coefficient Denden
FLOYD
- 利用MATLAB 实现Floyd 算法，可对输入的邻接距离矩阵计算图中任意两点间的最短距离矩阵和路由矩阵，且能查询任意两点间的最短距离和路由。 用MATLAB 仿真工具实现Floyd 算法：给定图G 及其边(i , j )的权 wi , j (1≤i≤n ,1≤j≤n) ，求出其各个端点之间的最小距离以及路由。 -Floyd achieved using MATLAB algorithms for the shortest distance routing adjacency matri
4
- 数据结构上机第七章第四题 求有向图中任意两个结点指定距离的边数 -Data structure chapter 7 NO.4 For any two nodes in the directed graph the specified distance of the number of edges
Dijkstra
- 图论中用dijkstra算法求解最短路问题的MATLAB代码，可求任意一点至其它所有点的最短距离和最短路径。-Dijkstra algorithm using graph theory shortest path problem MATLAB code, can be uated at any point to the shortest distance and shortest path to all other points.
hdu5102
- hdu5102的ac源码。算法：队列、数据结构、图论、模拟。题意：输入一棵树，输出前k小的点对最短距离dis（i，j）的和。-AC source of hdu 5102. Algorithm: queues, data structures, graph theory, simulation. Meaning of the title: Enter a tree, output the sum of the first k smallest shortest distance of dis (i
UVALive4849
- uvalive4849的ac源码。算法：2-sat。题意：给n（n<=3000）个黑方块的坐标，保证黑方块没有公共边。对于每个黑方块选一个角作为结点，使得所选结点满足输入的一个无向图。其中距离为曼哈顿距离。输出是否有解。possible或impossible。-AC source of uvalive 4849. Algorithms: 2-sat. Meaning of the questions: to n (n <= 3000) coordinates a black box,
voronoi
- 维诺图算法，实现维诺图的基本要求。维诺图，即按点的距离将平面分割-Vino graph algorithms, realize the basic requirements of vino map. Vino map, ie the distance between the point of the split plane
Ford_Fulkerson
- matlab最小费用最大流程序，图论，输入距离矩阵求解-The minimum cost maximum flow matlab program, graph theory, enter the distance matrix solver
ISOMAP-Algorithm
- ISOMAP算法，其中做了部分修改。算法采用K近邻图计算测地距离的方法，最后进行低维嵌入-ISOMAP algorithm, which made some modification.Algorithm of geodesic distance is obtained by using the K neighbor graph method, finally to low dimensional embedding
TspSolver
- TSP Solver is a very intuitive and user-friendly program that demonstrates two common ways of solving the TSP (Traveling Salesman Problem) of the Graph Theory. For a brief descr iption of the TSP, along with a quick reference to the solution
solve_show_value_1
- 基于RSSI的三点定位测算距离，并将坐标显示在图形中-Three RSSI-based localization estimates the distance, and the coordinates are displayed in the graph