搜索资源列表
shcool-guide
- 数据结构中的一个试验程序，实现简单的校园导游图功能，提供查找最短路径功能。-data structure of a test procedures, a simple guide campus map function, providing the shortest path search function.
path
- 这个是我们大学的一个小学期作业，是完成关键路径的搜索-this is our university a primary period of operation is the completion of the Critical Path Search
AStarDll A星路径搜索(采用二叉堆)
- 算法简述：A星路径搜索(采用二叉堆)，最短路径寻路算法-Algorithm Descr iption: A star path search (using the binary heap), the shortest path Algorithm for Route
ShowAllPath
- 用C#写的无向图中任意连通路径的搜索算法，可能行路径搜索-Written in C# to any connected graph path search algorithm, may line the path search. .
sourcecode
- 以上一共五个在VC环境下编写的程序，分别为串的基本操作，哈夫曼编译码系统，简单词法分析器，进程转换模拟控制，最短路径搜索算法。为节省上传时间，只有源代码，工程文件都删除了，但是上述源码都在本机上编译通过，并且能够正确运行。谢谢！-More than a total of five in the VC environment prepared by the procedure, namely the basic string operations, Huffman encoding and dec
search_graph
- 一个python程序，实现了无向图的结构模拟，以及广度优先搜索的算法，以及显示最短路径之一。用leo+ulipad实现。-A python program to realize the structure of an undirected graph simulation, as well as the breadth-first search algorithm, and display one of the shortest path. By leo+ ulipad achieved.
matlabyiqunsuanfa
- 蚁群算法是一种用来在图中寻找优化路径的机率型算法。是一种求解组合最优化问题的新型通用启发式方法，该方法具有正反馈、分布式计算和富于建设性的贪婪启发式搜索的特点。通过建立适当的数学模型，基于故障过电流的配电网故障定位变为一种非线性全局寻优问题。-Ant colony algorithm is a method used to find optimal path in the graph the probability-based algorithm. Is a combination of opt
park
- 是公园路径搜索的c++实现方法，功能比较简单，是课程设计的。用到了迪杰斯特拉算法和贪心算法求最短路径-Is a park path search c++ implementation method is relatively simple functions, curriculum design. Use the Dijkstra algorithm and the greedy algorithm for the shortest path
GIStransportation
- 利用公 交线路路 口作 为顶 点，简化 了传统算 法对复 杂 网络拓扑 图的计 算；同时，利 用乘客 出行 偏好 ．引入 线 网密度来评 价乘客的 出行 方便程度 ，并提 出了一种最短路 径快速搜 索算法．实验证明 ，与传 统算法相比 ，该算法明显提 高了路径搜 索效率． -Intersection as the peak use of bus lines, simplified the traditional algorithm is the calculation of comp
TopoOrder_Level
- 单向图的最短路径搜索算法，首先对节点进行拓扑排序，然后实现复杂度为O（m）的最短路径搜索。-Single shortest path graph search algorithm, the first topological sort of nodes, and then implement the complexity of O (m) of the shortest path search.
Dijkstra-the-shorest-path
- 最短路径djist算法的C++实现源码 -the implements of Dijkstra using C++ search for the shorest path
astarr
- 这是一个基于A*算法的搜索算法，可用于路径的查找。-This is an algorithm based on A* search algorithm, can be used for path search.
bashuma
- 三种最短路径搜索算法在八数码问题中的比较和演示-Shortest path search algorithm of three digital issues in the eight comparison and demonstration
Findpath
- 使用VC实现路径查找算法demo。有图形显示路径查找过程。-Implement path search algorithm using the VC demo. A graphics display path search process.
4_Dijkstra
- Dijkstra搜索最短路径，通过使用数据结构，构图，可以修改数据-Dijkstra shortest path search
dianshuzhisanjiaoxing
- 用动态规划来的思想求解点数值三角形的最优路径搜索，-With the idea of dynamic programming to solve the point value of the optimal path search triangle,
path
- 迷宫是一个二维矩阵,其中1为墙,0为路,3为入口,4为出口.要求从入口开始,从出口结束,按照 下,左,上,右 的顺序来搜索路径-The maze is a two-dimensional matrix, including one for the wall, 0 for the road, 3 for the entrance, four of them for export requirements from the entrance from the export end of the se
maze1
- 本程序上层算法采用深度搜索和广度搜索相结合的折中方法，能适合大部分迷宫的最优路径搜索。-This program algorithm using the upper search and breadth first search depth of the combination of this way, for most of the maze can the optimal path search.
picture
- 数据结构的核心单元图，程序里有写好的包括图的几种遍历和最短路径搜索-The core unit of the data structure diagram, program written including several traversal and shortest path search
structure-array-code
- 根据队列搜索算法的基本思想，现设计了一个简单的结构体数组如下定义代码所示。此结构体数组具备控制结点搜索和存储结点信息和路径的功能，可以较好的实现TDN的最小时间路径搜索。-Search algorithm based on the basic idea of the queue is now designed a simple structure array as defined code. This structure array with the control