搜索资源列表
POJ_3131
- POJ 3131 双向BFS解立体八数码问题-POJ 3131 bi-dimensional eight digital BFS Solutions
BFSandDFS
- ABout BFS and DFS search algorithm
TSP
- 使用邻接表记录存贮村庄两点的ID和村庄之间的权值。采用广度搜索，利用邓俊辉老师的模板BFS。先任取一点，搜索到它的距离最远的点（带权值）i，点i必然是关键路径上的一个最远点。再以该点为起始点搜索离他距离最远的点（带权值），所得到的一定是donfood即最远路径。-Using adjacency table records the ID stored villages and villages between the two weights. Using breadth search, use D
pacmansearch
- Pacman from UC Berkeley-Pacman hw from CS188 in UCberkeley. Give better understanding in BFS, DFS, UCS and A* search.
multiagent
- 实现了一个吃豆人小游戏的功能，使用了多种搜索算法，包括DFS以及BFS等-Implements a Pac-Man game features, using a variety of search algorithms, including DFS and BFS, etc.
Peg-solitaire-CppBFS
- Peg solitaire is a classical puzzle commonly played on a 33-hole cross-shaped board (also called "the English Board") or a 15-hole triangular board. A valid move is to jump a peg orthogonally over an adjacent peg into a hole two positions away and
P
- 规范 BFS 写法，可以有效地避免一些状态判重和状态转移上的细节错误，使用优先队列，这里不用优先队列会错。-BFS written specification, can effectively avoid the details of some of the state and the state transition heavy sentence on the error, use the priority queue, priority queues are not wrong here.
MDS_Project
- A combining breadth-first search (BFS) or depth-first search (DFS) with aware range to find minimum connected dominating set A backbone in a Wireless Sensor Network (WSN) reduces the communication overhead, increases the bandwidth efficiency, de
Lopez-Valenzuela
- Un Block Me solve with heuristics and BFS search.
BFS-for-eight-digit
- 广度优先搜索实现八数码，源码和可执行文件， 未优化，带注释-Breadth-first search to achieve eight digital, source code and executable files, Unoptimized, annotated
BFS
- 迷宫问题 队列求解 界面还不完善 可以自己添加-Maze problem solving interface queue is not perfect you can add your own
bfs_mex
- bfs FGFJF KDLFLF LFLMLFMF
Handout
- 创建图的邻接表存储结构,输出邻接表数据(验证创建过程),深度优先遍历(DFS) ,广度优先遍历(BFS),增加一个顶点到图, 删除一个顶点(同时删除其所有邻接边) ,增加一条弧到图,从图中删除一条弧- Creating adjacency table storage structure, the output adjacency table data (validation creation process), depth-first traversal (DFS), breadth-fi
tu
- 图的深度优先与广度优先遍历 利用邻接矩阵或邻接表作为存储结构建立一个无向图，每个顶点中存放一种水果名(例如apple、orange、banana等，并要求从键盘输入)，顶点数不少于5个。要求分别以深度优先搜索(DFS)和广度优先搜索(BFS)进行遍历，输出遍历结果。 -Depth-first and breadth-first traversal Adjacency matrix or adjacency list use as
pathfinding-0.1.1-src
- A星， Dijkstra，双向BFS实现的路径规划程序Python源码，有界面，附带演示效果。-A star, Dijkstra, BFS achieve bidirectional path planning process Python source code, interface, with a demonstration effect.
data_struct
- 自己实现的重要的数据结构以及算法（包括dfs,bfs,huffman code,kmp,dij等）。每一个.cpp或.c文件都是一个可直接运行的程序。-Important data structures and algorithms to achieve their own (including dfs, bfs, huffman code, kmp, dij, etc.). Every one. Cpp or. C file is a program can be run directly.
Maze-Problem
- 经典迷宫问题BFS，手动打表寻找出口解决-Classic maze problem, manually hit the table looking for export
classical-algorithm
- 关于经典算法的思考与总结。涵盖KMP.遗传.启发式搜索.图像 特征提取 SIFT.傅立叶变换.Hash.快速排序.SPFA.快递选择 SELECT A*.Dijkstra.DP.BFS/DFS.红黑树等 15 个经典基础算法， 共计 31 篇文章，包括算法理论的研究与阐述，及其编程的具体实现。很多个算法都后续写 了续集-Thinking about the classical algorithm and summary. Covering the KMP. Genetic heuri
Graph
- Graph with adjacency list with dfs and bfs traversal functions
BFSTraverse
- 利用BFS算法和队列实现在棋盘上已知“马”的初始位置，得到其在指定步数内可以到达的所有位置的功能-Use BFS algorithm and queue on the board to achieve a known " horse" in the initial position, get the function which can be reached within a specified number of steps in all positions