搜索资源列表
short-road
- 对一个运输商来说要把货运到收货地点选择最短的路线运输是其实现最大利润的要求，那么怎样选择最短的运输路线呢？在运输交通图中，我们设每一个城市为一个结点（vertextype类型）点并把他们分别用关键字代表（关键字int key ），也就是说把每个城市给出一个整数编码；一个城市直接到另一个城市的交通路线为边且这两个城市为相邻结点，不妨设这条路线的距离为边的权值（权值int weight ），易知距离越短运费就越低。这样就可以建立一个无向有权图，那么求最短的运输路线问题就转化为求图中一顶点到其余各个顶
graphbfs
- 读图并输出图的邻接链表，输入两个结点，用广度优先寻找它们之间的最短路径并输出，并判断其是否是树，是否连通，是否有环，有要打印出来环．-interpret drawings and prints of adjacent chain, the importation of two nodes, with breadth between them priority for the shortest path and output, and a judgment whether it is trees,
dijkstraCPP
- 由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 sho
MinPath
- 数据结构应用，用以寻找2点之间的最短路径，有效节省时间。以上程序只是一个雏形-application data structures, 2:00 to find the shortest path between effectively save time. Above procedure is just a prototype
netlayer
- VC+MO最短路径算法 // 计算线的几何长度 double CalcLength() // 通过线的id得到线数据 BOOL GetLineData(int id) // 得到距离某点最近的线段，返回该线段的id int GetNearestLineData( double x, double y) // 判断两点是否重合 BOOL IsPtCoincide( NetPoint ptFirst, NetPoint ptSecond ) /
shortestpath(file-based)
- 用Visual C++编写的一个基于文本文件的最短路径程序源码-prepared text of a document based on the shortest path procedures FOSS
findroad
- 灭火机器人模拟现实通过最短路径找到灭火器并去灭火-firefighting robot simulation of reality through the shortest path to find a fire extinguisher and fire
sys_dll_3
- 这是用于个GIS中的最短路径的算法，通常的经典算法有无法自学习的功能，而此算法很好的解决了此问题-This is a GIS for the shortest path algorithm, usually classical algorithm is not self-learning function, This algorithm good solution of this problem
NodeList
- 用于迷宫探路，人工堆栈。输出一条路径，但不能输出最短路径，并能判断米共是否有解-maze for the Pathfinder, artificial stack. An output path, but not the shortest path output, and the ability to determine whether a solution has meters
TravelingSalesmanProblemwithGeneticAlgorithm
- this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once) Notes: 1. Input error checki
CMousemaze
- 一个用C++实现的迷宫程序，可以自己画迷宫，计算出最短路径，并显示。-C achieve a maze of procedures, can you paint the labyrinth, calculate the shortest path, and displayed.
Matlabzuiduanlujing
- matlab算最短路径的算法，很好用大家可以试一试-Matlab operator of the shortest path algorithm, we can use a good try
Dijkstra_TA
- 数据结构的经典实验程序。以全国主要城市为图的顶点, 铁路连接为图的边, 距离作为加权, 设计完成一个最短路径自动查找系统；输入为出发城市和目标城市, 输出为最短路径和距离。 -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
Flody_ShortestPath
- 在VC++环境下,实现Flody最短路径算法的演示过程,操作方便,使用鼠标点击即可.-in VC environment, the realization of the shortest path algorithm Flody the demo process, convenient operation, use a mouse click away.
XiaoYuanDaoYouTu
- 本人用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
show_zuiduan
- 这是我的作业，是当时全班最好的，最短路径演示系统，能自定义节点和路径，显示出最短路径，节点用了组件，整个程序用了皮肤组件。-This is my work, then the whole class is the best, shortest path demonstration system can be defined nodes and trails. show that the shortest path, using a node components, with the whole
vivaldi-sim-Aug232006.tar
- 题描述的是一个旅行商要到几个城市去，每个城市必须去一次且仅能去一次，要求满足这样条件的最短路径。将本软件稍作扩展即可用于城市规划、公交车路径安排-that descr iption is a traveling salesman to several cities, each city must go to one and only one, satisfy requirements for the shortest path. This software can be used for som
Dijkstra_c
- C#中实现最短路，该图算法描述的是这样的场景：图由节点和带有方向的边构成，每条边都有相应的权值，路径规划（最短路径）算法就是要找出从节点A到节点B的累积权值最小的路径。-achieve the most short-circuit, the algorithm described in the plan that is the scene : map with nodes and from the direction of the edges, and each side has a corre
BestWay1
- 最短路径算法的一种高效实现。适合在节点密集的环境中找两点之间的最短路径。-shortest path algorithm to achieve a highly efficient. Suitable for the node-intensive environment between 2:00 find the shortest path.
campusNavigate
- 校园导航程序，数据结构中图的利用的典型例子（我的一次课程实验源代码），本代码用C语言编写； 基本功能： 1.校园景点信息的查询功能。 2.校园景点最短路径查询功能。（求图的最小路径）-campus navigation procedures, the data structure using the map of a typical example (I once Experimental source code), The code in C language; basic fun