Welcome！[Sign In] ！[Sign Up]！
Front-page it | Collect it | [中国-简体中文]
FAQ Fav
Location:
Search - 最短路径和

Search list

[Other] 最短路径和最小生成树

Description: 最短路径和最小生成树-shortest path and minimum spanning tree
Platform: | Size: 1278 | Author: 徐宾 | Hits:

[MiddleWare] 最短路径分析代码

Description:

其中线的模型只考虑了最简单的情况：即用户模型中的一短路径即一条polyline，而组成一条polyline的segmentcollection也包涵一条line。
    程序执行的顺序即按界面按钮的顺序自上而下执行：打开mxd文档->初始化->构建拓扑网络->Plan->选择目的点->获取路径->显示路径->刷新,如需要重复查询，需要 刷新 ->选择目的点->获取路径->获取路径->显示路径,以此类推。
    程序中还有若干bug尚未完善，如内存释放等问题，因时间关系尚未解决。程序附带测试数据。
    此段代码是因工作需要所做的测试代码，有待进一步完善。也希望研究最短路径的xdjm们能和我多多交流!


Platform: | Size: 101508 | Author: jkz0613 | Hits:

[SourceCode] C++作业

Description: 设图中各边的权值都相等，试以邻接矩阵和邻接表为存储结构，分别写出算法： 　(1)求顶点vi到顶点vj(i<>j)的最短路径 　(2)求源点vi到其余各顶点的最短路径 　　要求输出路径上的所有顶点(提示：利用BFS遍历的思想)
Platform: | Size: 4564 | Author: 735092706@qq.com | Hits:

[SourceCode] 粒子群算法计算最短路径

Description: 优化问题是工业设计中经常遇到的问题,许多问题最后都可以归结为优化问题. 为了解决各种各样的优化问题,人们提出了许多优化算法,比较著名的有爬山法、遗传算法等.优化问题有两个主要问题:一是要求寻找全局最小点,二是要求有较高的收敛速度. 爬山法精度较高,但是易于陷入局部极小. 遗传算法属于进化算法( Evolutionary Algorithms) 的一种,它通过模仿自然界的选择与遗传的机理来寻找最优解. 遗传算法有三个基本算子:选择、交叉和变异. 但是遗传算法的编程实现比较复杂,首先需要对问题进行编码,找到最优解之后还需要对问题进行解码,另外三个算子的实现也有许多参数,如交叉率和变异率,并且这些参数的选择严重影响解的品质,而目前这些参数的选择大部分是依靠经验.1995 年Eberhart 博士和kennedy 博士提出了一种新的算法;粒子群优化(Particle Swarm Optimization -PSO) 算法 . 这种算法以其实现容易、精度高、收敛快等优点引起了学术界的重视,并且在解决实际问题中展示了其优越性。
Platform: | Size: 1797 | Author: 805951849@qq.com | Hits:

[Other] 最短路径和最小生成树

Description: 最短路径和最小生成树-shortest path and minimum spanning tree
Platform: | Size: 1024 | Author: 徐宾 | Hits:

[Data structs] 最短距离问题

Description: 求解网络中的最短路径。假设某个计算机网络有n个站点，依次编号为1,2,…,n；有的站点之间有直接的线路连接（即这两个站点之间没有其它站点），有的站点之间没有直接的线路连接。如果用三元组（i,j,f）来表示该网络中的站点I和站点j之间有直接的线路连接且它们之间的距离为f 当已知该网络各站点之间的直接连接情况由m个三元组（i1,j1,f1）,(i2,j2,f2),…,(im,jm,fm)确定时，要求计算出对于网络中任意一个站点g(1≤g≤n)到其余各站点的最短距离。-the shortest path. Assuming a computer network n site, followed by No. 1, 2, ..., n; Some sites have direct connections (that is, between two sites are no other site), and some sites have no direct connections. If three yuan (i, j, f) to the network said the site j site and I have direct connections between them but the distance of f the network known as the site of the direct link between the situation by 3 m (i1, j1, f1), ( i2, j2, f2), ..., (im, jm, fm) to determine, calculate requirements for a network site arbitrary g (1 g n) of the rest of the site is the shortest distance.
Platform: | Size: 10240 | Author: 葛林 | Hits:

[Program doc] 基于MapX的道路拓扑与最短路径分析

Description: 这是基于mapx对道路拓扑分析和路径最短分析的详细论文，非常有价值。-This is based on the right road MapX topological analysis and the shortest path of the detailed papers, very valuable.
Platform: | Size: 27648 | Author: 安黎 | Hits:

[Windows Develop] 全国交通咨询系统

Description: 一　题目 全国铁路交通咨询系统 二　需求分析 1.系统配制： 硬件：CPU：P4 1.6G 内存容量 256M 标准输入输出设备 软件：操作系统Windows xp 源程序调试工具VC6.0 可执行文件运行工具 DOS 5.0. 2.该系统有供用户选择的菜单和交互性。 3.建立一个全国铁路交通咨询系统，该系统具备自动查找任意两城市间铁路交通的最短路径和最少花费的功能。 三　设计概要 1.抽象数据类型 本程序运用了关于图这种数据结构。 他的抽象数据类型定义如下： typedef struct unDiGraph { int numVerts //结点 costAdj cost //邻接矩阵 }unDiGraph,*UNG 基本操作： unDiGraph* CreateCostG() 操作结果：构造带权(费用)图。 unDiGraph* CreateTimeG() 操作结果：构造带权（时间）图。 PathMat *Floyed(unDiGraph *D) 操作结果：Floyed函数 求任意两点的最短路径。 -a subject of the national railway traffic advisory system analysis of a two needs. Preparation System : Hardware : CPU : P4 1.6 GHz 256 MB of memory standard input and output device software : Windows XP operating system source code debugging tools VC6.0 executable file running DOS 5 tools. 0. 2. The system is available for users to choose the menu and interactive. 3. The establishment of a national rail traffic advisory system, the system automatically search with arbitrary two inter-city rail traffic and the shortest path to the function at the lowest cost. Three design an outline. This abstract data type procedures on the use of this data structure map. His abstract data type is defined as follows : typedef struct (int unDiGraph numVerts// node costAdj cost// adjacency matrix) unDiG
Platform: | Size: 56320 | Author: gang | Hits:

[Data structs] 最短路径的求解

Description: 本实验中的问题是一个逻辑问题，而实验的目的是运用邻接矩阵解决图存储并解决在此结构情况下对矩阵中元素的扫描计算。其关键是怎样储存和计算。储存用的是邻接矩阵，而计算是用迪杰斯特拉算法。-experiment of the problem is a problem of logic, and The purpose of this experiment is to use the adjacency matrix storage solutions and plans to solve the structure of the matrix elements of scanning calculation. The key is how storage and computation. The store is adjacent matrix, which is calculated using Floyd algorithm.
Platform: | Size: 9216 | Author: 哈哈发 | Hits:

[Data structs] TravelGuideApp

Description: 最短路径和哈密顿通路，可以求得多条最短路径和哈密顿通路。-shortest path Hamiltonian path and can be obtained over the shortest path and Hamiltonian path.
Platform: | Size: 72704 | Author: 王辉 | Hits:

[Graph Drawing] path

Description: VB＋MAPX的最短路径源码，可以查询显示最短路径和距离-the shortest path source, inquiries reveal that the shortest path and distance
Platform: | Size: 15360 | Author: 刘光远 | Hits:

[Data structs] Win32Maze

Description: Win32下立体迷宫程序，含自动求解，可求迷宫最短路径和所有路径，分别用广度优先搜索和深度优先搜索两种方法实现，欢迎讨论。-Win32 three-dimensional maze procedure, including automatic solution Stepping maze shortest path and all trails. priorities were used to search breadth and depth-first search in two ways, welcomed the discussion.
Platform: | Size: 24576 | Author: enderlw | Hits:

[Mathimatics-Numerical algorithms] dijkstraCPP

Description: 由graph.txt读出源图并用临街链表显示出，然个用dijkstra算法算出给定两点的最短路径和任一给定点到其它各点的距离，graph.txt放在源代码同一目录，内附graph.txt示例-graph.txt read out by the source map and used chain along the street shows, However use the dijkstra algorithm to calculate the scheduled 2:00 and the shortest path as a sentinel for other points of the distance, graph.txt on the same source code directory, containing examples graph.txt
Platform: | Size: 702464 | Author: 比为 | Hits:

[Data structs] Dijkstra_TA

Description: 数据结构的经典实验程序。以全国主要城市为图的顶点, 铁路连接为图的边, 距离作为加权, 设计完成一个最短路径自动查找系统；输入为出发城市和目标城市, 输出为最短路径和距离。 -data structure of the classic experimental procedure. In major cities across the country to the vertex, the railway linking the edge of the map, as the weighted distance, Design completed a search for the shortest path automatic system; input as the starting cities and urban target, the output for the shortest path and distance.
Platform: | Size: 795648 | Author: 王斐 | Hits:

[Windows Develop] XiaoYuanDaoYouTu

Description: 本人用C++编写的一个校园导游图。欢迎界面是我们学校的。用的时候随时改成你学校的就成。：） 通过最小生成树算法和两点间最短路径算法，实现查看两景点间最短路径和查看最佳游览路线。-I prepared a campus tour guide map. We welcome the interface schools. Used anytime when you changed it into schools. :) Minimum spanning tree algorithm and the shortest path between two points algorithm, View two spots to achieve the shortest path between the View and the best tour route.
Platform: | Size: 29696 | Author: li | Hits:

[Algorithm] 58

Description: 求解最优交通路径，程序预置部分城市间距离，由用户选择两个城市，计算出两城市间最短路径和相应路线。-Optimal traffic paths, procedures preset distance between some cities, by the user to choose two cities to calculate the shortest path between two cities and the corresponding line.
Platform: | Size: 2048 | Author: bellinwater | Hits:

[matlab] Floyd

Description: 用matlab来仿真floyd算法，并计算任意两点的最短路径和路由；-Using matlab to simulate floyd algorithm, and calculate any two of the shortest path and routing
Platform: | Size: 35840 | Author: wuyinkui | Hits:

[AI-NN-PR] GAAS

Description: 遗传算法与蚁群算法演示程序~ 城市间最短路径和曲线图-Genetic algorithm and ant colony algorithm demo program ~ the shortest path between cities and the curves
Platform: | Size: 605184 | Author: 王凤鸣 | Hits:

[Other] 最短路径法射线追踪的MATLAB实现

Description: 本文探讨了在MATLAB环境中实现最短路径射线追踪的方法和步骤，并通过数值模拟演示了所编程序在射线追踪正演计算中的应用。(This paper discusses the method and steps of realizing the shortest path ray tracing in MATLAB environment, and demonstrates the application of the program in ray tracing forward calculation by numerical simulation.)
Platform: | Size: 60416 | Author: DOGGY | Hits:

[Data structs] 图的最短路径之迪杰斯特拉和弗洛伊德算法

Description: 数据解构中的经典算法，图的最短路径算法之迪杰斯特拉和弗洛伊德的C++实现(Classic algorithms in data deconstruction, Dijkstra's and Floyd's C++ implementation of the shortest path algorithm of graphs)
Platform: | Size: 1024 | Author: 大爱快船 | Hits:
« 12 3 4 5 6 7 8 9 10 ... 33 »

CodeBus www.codebus.net