搜索资源列表
Cpp1
- 校园导游，可以选择景点序号来了解景点，通过选择两点可计算最短距离和最近路线。-Campus tour guide, you can choose the attractions serial number to understand the attractions of by selecting the shortest distance can be calculated and the recently routes.
shiqu
- 连接各路口节点，统计道路条数，求出各道路的长度，并求出所有顶点对间的最短距离-Connect each node of the intersection, statistics, road number, find the length of the road, and calculated the shortest distance between all vertices
aa
- 连接各路口节点，统计道路条数，求出各道路的长度，并求出所有顶点对间的最短距离-Connect each node of the intersection, statistics, road number, find the length of the road, and calculated the shortest distance between all vertices
jijog
- 这是计算任意两个城市之间的最短距离的数据结构算法-This is a data structure algorithms calculate the shortest distance between any two cities
floyd
- 计算两点间的最短距离，从而得到最短路径，广泛应用与数学建模。-Calculate the shortest distance between two points, the shortest path, and wider use of mathematical modeling.
VCPP
- 自己写的 VC++求两个线段（城市）最短距离的算法-The shortest distance algorithm to write their own VC++ seeking two segments (city)
Floyd
- Floyd算法的matlab实现。对输入的邻接距离矩阵计算图中任意两点间的最短距离矩阵和路由矩阵，且能查询任意两点间的最短距离和路由。并根据结果自动绘制出了最短路径图。 程序中使用了前向路由和回溯路由两种方法，并对于无向图进一步减小算法复杂度。-Matlab implementation of the Floyd algorithm. Adjacent input distance matrix between any two points in calculating the figur
Amainzipn
- 蚁群算法计算城市最短距离，mmatlab源代码可直接使用。 -Ant colony algorithm to calculate the city' s shortest distance, mmatlab source code can be used directly.
xiaofang
- 城市消防站点选址问题的代码 用于求出两点间最短距离以及选址最佳坐标-City Fire Station Location code is used to calculate the shortest distance between two points and the location of the best coordinate
DJshortpath
- 此MATLAB文件专门用于求某个顶点到其他顶点的最短距离-This MATLAB file dedicated to seeking the shortest distance of a vertex to other vertices
floyd
- 用floyd的方法求解距离矩阵中任意两点间最短距离求解-Floyd method for solving the shortest distance between any two points of the distance matrix solving
q11
- 搜索各个平台的最短距离，以分配平台的管辖范围-To search the various platforms shortest distance to allocate the jurisdiction of the platform
flord
- 弗洛伊德算法，求出任意两点的最短距离，有路径的-Freud' s algorithm to find the shortest distance between any two points, path
suanfa
- 自己编写的floyd 最短距离求解程序。实用简单。gcc -Floyd shortest distance to write your own solver. Practical and simple. gcc
cal_distance
- 本程序用于在给定风向的情况下，计算风从某点传播至另外一点的最短距离-This procedure is used in the case given Winds calculate the wind is propagated to another point of the shortest distance from a certain point
quanpai
- 能够实现在输入的实数中找到其中两个实数的距离最短-Find one of the shortest distance of the two real numbers can be achieved in the real number input
statistical-analysis
- MultiLineReg:用线性回归法估计一个因变量与多个自变量之间的线性关系 PolyReg 用多项式回归法估计一个因变量与一个自变量之间的多项式关系 CompPoly2Reg:用二次完全式回归法估计一个因变量与两个自变量之间的关系 CollectAnaly:用最短距离算法的系统聚类对样本进行聚类 DistgshAnalysis:用Fisher两类判别法对样本进行分类 MainAnalysis:对样本进行主成分分析.-MultiLineReg: estimated
Floyd
- 图论计算任意两点间最短距离的经典算法,MATLAB实用算法-Graph theory to calculate the shortest distance between any two points in the classic algorithm
floyd_method
- 弗洛伊德算法求两点间最短距离。也是数据结构实验要用的算法，小做修改，改成自己需要的就能验收-Freud algorithm for getting between two points is the shortest distance.
Dijkstra
- 目前网络上电子地图的使用很普遍。利用电子地图可以很方便地确定从一个地点到另一个地点的路径。特别地，可确定在城市中的公交换乘路线。 电子地图可以看成是一个图，而公交线路图可看成是带权有向图G =(V,E)，其中每条边的权是非负实数。 你的任务：对给定的一个（无向）图G，及G中的两点s、t，计算从顶点s到顶点t的最短距离和最少路段数。-On the network, the use of electronic maps is common. Electronic m