搜索资源列表
ConsultationDlg
- 最短路径搜索算法的应用。利用最短路径搜索作为校园地图导航-shortest path search algorithm applications. Use the shortest path search as a campus map navigation
maze dfs
- dfs 深度优先搜索！这是走迷宫的基本算法。用广义表建立迷宫，用邻接表建立图，用dfs搜索，许多大学的数据结构作业-dfs depth-first search! Maze This is the basic algorithm. Generalized Table established maze, with the establishment of the adjacent table map, with dfs search, the University of many data str
zhou_end2
- 我的数据结构课程设计，卡诺图化简。在算法上摸索了很久，第一次去交的时候因为老师的几个刁钻的数据给刷下来，至今仍心有余悸。还有一个用PASCAL写的16变量化简的，可不知道放哪去了。-my data structure curriculum design, Karnaugh map of SR. The algorithm groping for a long time, the first to go out and make the time because the teacher in s
用C++描述的各种数据结构算法
- 包含几十个有关数据结构算法的源代码 包括栈 队列 树图等 是初学者的最佳选择-contains dozens of the data structure of the algorithm source code stacks include Queue tree map is the best choice for beginners
图深度优先
- 图的深度优先算法动态演示，用到了直线的中点绘制算法-map algorithm for dynamic priority depth demonstration of the use of linear midpoint Rendering Algorithm
导游图
- 用c语言实现的导游图，有图形界面，支持鼠标操作，使用dfs和floyd算法实现给出两点间最短路和最长路。-used language guides map, a graphical interface, mouse support operation, use dfs and Floyd algorithm is the shortest path between two points and the longest path.
GreedyTP
- 同学做的基于贪婪策略的拓扑排序算法可视化演示程序，支持用户自己画出拓扑图，VC++.net下测试通过。-students so greedy strategy based on the topological sorting algorithm visualization demo program that allows users to draw their own topology map, VC. Net under test.
WinScenery
- 学校导游系统。采用最小路径算法。程序可自动生成图，并可找出最小路径。-school system guides. Use the smallest path algorithm. Procedures can be automatically generated map can identify the smallest path.
zn
- 用C语言写的多段图算法的实现,多段图是动态规划的一个典型的实例.-C language in many of the map algorithm to achieve more of the map is a dynamic planning a typical example.
fudfs
- 用dfs非递归算法遍历图。创 建图是用链表来实现。 -with scores of non - recursive algorithm traverse map. Map is created using chain is to be achieved.
xdcode1
- 本文研究对彩色地图图象中的道路识别提取的问题。讨论了基于聚类分析的一种按颜色分离地图要素的算法，并对若干影响效果的问题提出了修正和解决办法。-this paper right color map image from the road recognition problem. Based on the discussion of a cluster analysis separated by color map elements of the algorithm, as well as a nu
MazeGame_VC++
- 一个简单的迷宫小游戏 运用迷宫算法实现迷宫小游戏，功能有设置迷宫大小、新建迷宫、显示走过路径、迷宫图的保存和打开、游戏的自动玩等功能。-a simple maze game using small maze algorithm maze of small game, functional install maze size, new maze, showing traversed path, the preservation of the maze map and opened the ga
gongyuan
- 用图实现的公园导游图，包括最短路径，最优走法等的算法-map with the park guide map, including the shortest path, the optimal law to the algorithm
Bird4
- 四色图着色问题，离散数学的经典算法，用c实现，输入一个图，用小于4种颜色着色-four-color map coloring, Discrete Mathematics classical algorithm, using c realize that the importation of a map, with less than four colors Coloring
des
- Prim算法完整实现代码 用Prim算法求无向图的最小生成树 -Prim algorithm to achieve a complete code with Prim algorithm try to map the minimum spanning tree
tu
- [输入] 图的顶点个数N，图中顶点之间的关系及起点A和终点B [输出] 若A到B无路径，则输出“There is no path” 否则输出A到B路径上个顶点 [存储结构] 图采用邻接矩阵的方式存储。 [算法的基本思想] 采用广度优先搜索的方法，从顶点A开始，依次访问与A邻接的顶点VA1,VA2,...,VAK, 访问遍之后,若没有访问B，则继续访问与VA1邻接的顶点VA11,VA12,...,VA1M，再访问与VA2邻接顶点...，如此下去，直至找到B，最先到达
DFS1
- 用DFS算法遍历图-with DFS traversal algorithm map
连连看算法
- 连连看算法连连看通路检测算法地图设置（要改进）横纵参数应该可以设置-1000 block of Terry Avenue algorithm detection algorithm 1000 block of Terry Avenue pathway map settings (to improve), vertical and horizontal parameters can be set up
algo & data structures graphs
- 图的遍历:图是由顶点集合(vertex)及顶点间的关系集合组成的一种数据结构:Graph＝( V, E ).使用拓扑排序的算法.-traverse the map : The map is set by the vertex (Vertex) and the relationship between peak set consisting of a data structure : Graph = (V, E). The use of topological sorting algorithm.
map
- 华科地图，里面有自己的算法，还是知道借鉴的-Huake map, which has its own algorithm, or know learn