搜索资源列表
Entity0
- its for shortest path algorithm
Entity3
- its for shortest path algorithm
EventListImpl
- its for shortest path algorithm
2222
- ( 从太原市公交查询系统建立的必要性出发, 进行了公交查询算法的研究, 主要探讨了包括最短路径查 询及最少花费查询及数据库管理的公交查询系统的实现。 该系统采用了V ISU AL BA S IC 610 为开发工具, M ICRO SO FT A CCESS2003 为后台数据库, 开发了基于太原市公交线路的公交查询系统。具有线路查询、换乘 查询、 站点查询、 数据管理等一系列功能。 -(From the city bus system the need for inquiry
zdlj
- 最短路径问题（包括Floyd算法和避圈法）的matlab程序，较实用-Shortest path problems (including Floyd algorithm and avoid the circle method) matlab procedures, more practical
lvyou.frm
- 西安市公交查询系统，效果不错。包含站点查询，最短路径。-Xi' an public inquiry system, good results. Site contains information, the shortest path.
tanchishe
- 贪吃蛇算法，可用于最短路径的查询，C#实现，可将次算法用于物流配送，旅游线路等系统中。-Snake algorithm, can be used for shortest path queries, C# to achieve, can be sub-algorithm for the logistics and distribution, travel routes, such as system.
dijkstra
- Dijkstra算法的基本思路是：假设每个点都有一对标号 (dj, pj)，其中dj是从起源点s到点j的最短路径的长度 (从顶点到其本身的最短路径是零路(没有弧的路)，其长度等于零)；pj则是从s到j的最短路径中j点的前一点。求解从起源点s-Dijkstra algorithm is the basic idea: the assumption that each point has a pair of numbers (dj, pj), which is a dj point s from
dijkstra
- 用C语言实现的最短路算法 算法描述清楚，未结合文件操作-Realized with C language algorithm for shortest path algorithm described in clear, no combination of file operations
Minimumtree
- djikestra shortest path algorithm
shortpath
- 最短路径算法模拟 图的存储结构 熟悉掌握图中最短路径的算法 -The shortest path algorithm simulated map storage structure as familiarity with the shortest path algorithm for graph
danhang
- 解决导航问题，运用数据结构的最短路径的两种求解方法-To solve navigation problems, using the data structure of the two shortest path solution method
samatlab
- 模拟退火算法MATALAB源程序 此题以中国31省会城市的最短旅行路径为例，给出TSP问题的模拟退火程序-Simulated annealing algorithm MATALAB source of this problem of China' s 31 provincial capital cities of the shortest path of travel as an example, simulated annealing procedures for TSP problem
sa
- VB中最短路径算法的设计思路，并附带源码。-VB in the shortest path algorithm design ideas, and comes with source code.
Benders_Decomposition
- 一个好的最短路径算法参考文献——A benders decomposition approach-A benders decomposition approach for the robust shortest path problem with interval data.
Dijkstra_cpp
- c++ Example about Dijkstra shortest path. Works as a console application.
GISShort
- GIS中最短路径的算法实现，有助于理解，会有帮助的！-GIS in the shortest path algorithm to help understand it, it would be helpful!
TSP
- 用matlab解决TSP旅行商问题,针对30个城市最短路径进行优化-Using matlab to solve the traveling salesman problem TSP for 30 cities to optimize the shortest path
zuiduanlujingfenxi
- Dijkstra算法是求解网络中最短路径的精典算法，文中通过改变图的存储结构及搜索方法，减少了内存存储空间，缩短查询时间，以提高该算法在嵌入式GIS系统中路径优化的效率。-Dijkstra algorithm is to solve the classic shortest path network algorithm, the paper map by changing the storage structure and the search for ways to reduce the me
Deikstra
- For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex.