搜索资源列表
trip
- 帮助旅行者计算出，在他所能够承受的金额内，他从起点到目的地所需要经过的最短的旅行距离。 -To help travelers to calculate, within the amount he can afford to, he will need from starting point to destination through the shortest distance of travel.
algorith4
- 用分治法解决最近点对问题，就是将一个问题分解两个子问题，然后递归处理子问题，然后合并求出最短距离-Solve the problem closest point using divide and conquer method is to decompose a problem of two sub-problems, and then recursively processing sub-problems, and then find the shortest distance merge
Cgrafsuanfa
- 图论常用求最短距离算法，数组线性查找算法，VC++实现-Graph theory used for the shortest distance algorithm, an array linear search algorithm, VC++ achieve
zuijinlucheng
- 交通系统工程课程设计源代码，判断最短路程，设计路线-Transportation Systems Engineering curriculum design source code, to determine the shortest distance, design routes
DAOYOUCHENGXU
- 该程序在TC3.0环境下编译通过，共有5个函数。分别是Introduce，shortestdistance，floyed，display及main。 其功能分别是： Introduce：地点介绍函数。 Shortestdistance：计算两地的最短距离。 Floyed：floyed算法求两地的最短距离。 Display：打印两个地点的路径及最短距离至屏幕。 Main：总体控制各函数并提供原始数据。 -The program in TC3.0 environment
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
- 利用求最短路w-f算法的思想，首先求得最短距离矩阵，然后求任意给定两个顶点见的最短路所包含的顶点。-Wf seeking the shortest path algorithms use the idea, first seek the shortest distance matrix, and then seek to vertex given any two vertices see shortest contains.
aaa
- 蜂窝小区最短距离,VS2012工程，华为OJ-Cell shortest distance, VS2012 project
String3
- java实现编辑距离的计算 并输出与查询具有最小编辑距离的字符-using java implements editor distance and find the shortest distance
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
GPS
- 校园导航系统 规划校园路线 算出最短距离等-Planning the campus with a campus navigation system Calculate the shortest distance, etc
floyd
- 利用MATLAB实现Floyd算法，可对输入的邻接距离矩阵计算图中任意两点间的最短距离矩阵和路由矩阵，且能查询任意两点间的最短距离和路由。-Floyd algorithm using MATLAB realize, can be routed to the shortest distance adjacency matrix and the distance matrix calculation map between any two points in the input matrix, an
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.
dijkstra
- 可执行的dijkstra算法，求解任意两点间的最短距离-Dijkstra executable algorithm for solving the shortest distance between any two points
Graph
- Graph measuring the Shortest Distance to vertex, class file for the The Path.java program.
floyd
- 用floyd算法实现求任意两点之间的最短路程。运筹学中带权图中两点间的最短路程算法。-Floyd algorithm using the shortest distance between any two points.
KNN
- SOPHISTICATED WAY FIND THE SHORTEST DISTANCE AMONG THE NEIGHBOR 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
A-Query-Dependent-Local-Landmark-Scheme
- Approximate Shortest Distance Computing A Query-Dependent Local Landmark Scheme
Dijkstra
- 该程序用Dijkstra算法寻找最小路径。输入为起点，终点，邻接矩阵。输出为最短距离，最短距离对应的路程。代码有详细注释说明。-The procedure used Dijkstra algorithm to find the minimum path. Enter as a starting point, end point adjacency matrix. The output is the shortest distance, shortest distance corresponds