搜索资源列表
work
- sjtu KC2B 获取迷宫/处理迷宫/深搜寻找迷宫走法/实时确定小车位置、车头方向/控制小车按迷宫解法行进-sjtu KC2B capture map with camera/make width of the route 1 pixel/DFS find a resolution/watch the car/drive the car to destination
PHASE_ACCUMULATOR
- PHASE Accumulator for DFS. VHDL full working codes-PHASE Accumulator for DFS. VHDL full working codes..
main
- 用数据结构来写的迷宫算法。用深搜（DFS）产生迷宫。并用A *寻路算法-Data structure of the maze algorithm to write. Generated maze with deep search (DFS). With A* pathfinding algorithm
permutations-and-combinations
- 经典DFS排列组合算法，简洁代码极易懂，使用DEV编写并编译，参加算法比赛必备算法- Classic DFS permutations and combinations algorithm, concise code is very easy to understand, the use of DEV to prepare and compile, to participate in the algorithm game algorithm
sousuosuanfa
- 搜索算法. 实现基于树的基本搜索算法(BFS)的哈密顿环. 实现基于树的基本搜索算法(DFS)的哈密顿环. 实现基于爬山法的的哈密顿环. 利用分支界限算法实现最小哈密顿环. -Search algorithm. To achieve the basic algorithm tree search (BFS) Hamiltonian ring. Implement basic search algorithm (DFS) based on tree ring Hamil
AI_8Reinas
- 8 queens java solucinador 8 reinas mediante dfs
8puzzle_dfs
- 实现了八数码问题，运用了图搜索中的DFS（深度优先搜索）。-翻译 实现了八数码问题，运用了图搜索中的DFS（深度优先搜索）。 The implementation of the eight digital issues, the use of the map search DFS (depth-first search).
dfs
- 分布式文件服务器，多个服务器之间通信,多个文件之间共享变量-Simple code-sharing variables
hashi-master
- 实现hashi游戏，可以自定义图纸，也可以使用内部图纸进行游戏。同时有自动解决图纸AI，采用DFS算法解决。- Implement hashi game, you can customize the drawings, you can also use the internal drawings for the game. At the same time there are automatic solution drawings AI, using DFS algorithm to sol
graph
- 数据结构-图的操作 1.图的建立 2.图的深搜 3.图的广搜 4.最短路-(1).print the graph. (2).print the sequence of vertex names getting Depth-First Search. (3). print the sequence of vertex names getting Breadth-First Search. Dfs Bfs dijkstra
graph_lin
- 数据结构以及算法实现 图的创建 深搜、广搜、最短路-(1).print the graph. (2).print the sequence of vertex names getting Depth-First Search. (3). print the sequence of vertex names getting Breadth-First Search. Dfs Bfs dijkstra
simllar
- 本资源包含基于蛮力法DFS解决TSP问题的相关代码以及TSP的城市数据-This resource includes DFS to solve TSP problem based on the brute force method, related code and city data of TSP
depth
- 用邻接表完成深度周游图。可以在主函数里修改设置的边，同时可以自定义输入周游起点。-use the LList to do the DFS
xelsm
- 用普里姆(Prim)算法构造最小生成树；图的DFS算法的非递归遍历函数-She (Prim) algorithm to construct minimum spanning tree
ic_ds
- 不能少于20字能不能少点啊啊啊啊啊啊啊啊啊啊亮led(test_leddsf aasdfas dfs dfa)
DFS
- 有界深度优先搜索，将八数码问题简化成三数码问题(Bounded depth first search simplifies eight digital problems into three digital problems)
756597
- 本资源包含基于蛮力法DFS解决TSP问题的相关代码以及TSP的城市数据(This resource includes DFS to solve TSP problem based on the brute force method, related code and city data of TSP)
主流分布式系统相关知识和区别20170823
- 主流分布式系统相关知识和区别，对于初学者，可以根据此文件整理的内容进行学习(dfs study file recod , list all kinds dfs soft)
Desktop
- POJ 泰国佛塔 (全局题号6048) AC代码 深度优先搜索 广度优先搜索(source code of POJ 6048)
lede_source-7eb58cf.tar
- file defines the config menu for Linux kernel, the following steps introduce how to add the GobiNet module into kernel tree