搜索资源列表
MSTApp
- 利用MSTApple算法求出两点之间的最短距离。-MSTApple algorithm using the shortest distance between two points is calculated.
MSTWApp
- 利用MSTWApple算法求出两点之间的最短距离。-MSTWApple algorithm using the shortest distance between two points is calculated.
PathApp
- 利用PATHApple算法求出两点之间的最短距离。-PATHApple algorithm using the shortest distance between two points is calculated.
TopoApp
- 利用TOPOApple算法求出两点之间的最短距离。-TOPOApple algorithm using the shortest distance between two points is calculated.
New-Text-Document-(2)
- 用Dijkstra算法求单源最短路径 输入参量ma是距离矩阵 输出参量是一个三行n列矩阵，每列表示顶点号及顶点到源的最短距离和前顶点-With a single-source Dijkstra shortest path algorithm for getting the input parameter ma is the output parameter from the matrix is a matrix of three rows of n columns, each colum
Floyd
- Floyd algorithm. Shortest distance between Nodes
(Dijkstra)-a-shortest-path-algorithm
- 大概流程如下： 初始对每个点e，令v[e]=0，dis[e]=inf 令起点dis[s]=0 每次找出p，使得v[p]=0，并且dis[p]最小 令v[p]=1 对每个和p相邻的q，用dis[p]+distance[p,q]去更新dis[q] 直到找不到v[p]=0-Probably process is as follows: For every dot e, initial [e] to v = 0, dis [e] = inf Make starting
cluster-analysis
- 运用Matlab中的一些基本矩阵计算方法，通过自己编程实现聚类算法，在此只讨论根据最短距离规则聚类的方法。-The use of Matlab, some of the fundamental matrix method, clustering algorithms, through their own programming, in which only discuss the rules under the shortest distance clustering method.
dj
- 算法最短路径，利用迪杰斯特拉算法来设计求任意两点最短距离-Shortest path algorithm, Dijkstra algorithm is used to design the shortest distance between any two points demand
Dijkstra
- 一点到另一点的最短距离 Dijkstra算法-Point to another Dijkstra algorithm for the shortest distance
shortpath
- 采用迪杰斯特拉算法实现求解一个城市到其余城市的最短距离-Dijkstra algorithm used to solve a city to the rest of the city' s shortest distance
cebk_tsp
- 用离散数学或图论的术语来说，假设有一个图g=(v,e)，其中v是顶点集，e是边集，设d=(dij)是由顶点i和顶点j之间的距离所组成的距离矩阵，旅行商问题就是求出一条通过所有顶点且每个顶点只通过一次的具有最短距离的回路。 -Discrete Mathematics or use the terminology of graph theory, assume that a graph g = (v, e), where v is the vertex set, e is the edge se
dijkstra
- 基于贪吃算法的两点间最短距离的源代码，简单易懂。-Greedy algorithm based on shortest distance between two points of the source code, easy to understand.
closed_point
- 最近点对的算法： 对给定数量的点，求其中点对的最短距离。（测试样本为1000,5000个点，跑出来的时间均为0（s））详细思路请看程序注释。-The nearest point of the algorithm: for a given number of points, find the point where the shortest distance. (1000,5000 the test sample points, running out of time are 0 (s))
a
- 缴费点选址问题，是数模中的热点，可以通过对最短路程、居民满意度、排队等待时间综合考虑，得到较为全面合理的结果-Payment point location problem is one of several modes in the hot, can by the shortest distance, residents satisfaction, waiting time into account, to be more comprehensive and rational results
bus_search_system
- 公交查询系统 JAVA 做到 实现了 多种查询方案.有 换乘优先,票价优先,路程最短-JAVA query system bus to achieve a variety of query plan to do there transfer priority, the fare first, the shortest distance ...
floy
- 弗洛伊德算法，解决两点间最短距离，所得税选址问题-Floyd algorithm to solve the shortest distance between two points, siting of income tax
Dijkstra
- Dijkstr的最短路径算法，实现功能是应用Dijkstra算法求图上二顶点之间的最短距离。-Dijkstr the shortest path algorithm, Dijkstra' s algorithm is applied to achieve functional requirements map the shortest distance between two vertices.
dijkstra
- dijkstra算法求最短路径的函数，无输入直接运行会生成一个例子供参考- DIJKSTRA Calculates the shortest distance and path between points on a map
Floyd
- 使用MATLAB求解最短距离的求法，使距离总和最小-Use MATLAB to solve the method of seeking the shortest distance, so that the sum of the minimum distance