搜索资源列表
BFS
- 用MATLAB写的宽度优先搜索函数，支持障碍设置和四叉树/八叉树的选择，在路径搜索方面有用。-First search function using MATLAB written in width, support the obstacles set up and quadtree/octree useful in terms of route search.
source
- to solve the best case number of which how many times the king located at some position(x1,y1) to move to kill the the other ones located some position(x2,y2) in the chessBoard. implemented by BFS-to solve the best case number of which how many ti
N-Queue_DFS
- BFS法求解N皇后问题，输出全部解决方案。-BFS method for solving N queens problem and output all solutions.
knight-tour_DFSandBFS_SQueue
- 在一个N*N的棋盘上指点任意一点的坐标，以马走日的方式走完整个棋盘且没有重复，试分别用DFS、BFS方法求解并输出全部可能的路径。-knight tour problem solved by the method of BFS and DFS.
BFS
- 实现图的广度优先便利算法，按照广度优先顺序吧图的节点打印出来-Facilitate realization of breadth-first algorithm graph, according to the node breadth priorities bar chart printed out
BFS
- 查找硬盘文件，并做结果或结果的文件做处理-Search the hard disk file, and do the results or results of the file to do the processing
search-(1)
- 这是著名的伯克利大学人工智能这门课上讨论的贪吃蛇游戏Pacman,其中讨论了UCS，A＊, DFS, BFS 这几种搜索算法-It s the famous game Pacman. The code includes search algorithm like UCS，A＊, DFS, BFS
Graph
- 图的存储、遍历、最短路径算法 图的DFS和BFS函数 Dijstra算法求最短路径-Graph storage traversal, shortest path algorithm graph DFS and BFS function Dijstra shortest path algorithm
diameter_basic_GraphChi
- 使用GraphChi计算图直径的估值。方法是Magnien 等人提出的 Double Sweep 算法，即两次BFS算法，一次向前一次向后。-Diameter valuation of a Graph using GraphChi framework. Using the method of Double Sweep that Magnien proposed, which is two bfs process.
bfs-dfs
- 图的邻接表的输入，表示，深度优先排序和广度优先排序,用c++编写-Enter the adjacency list graph showing the depth and breadth of prioritization prioritization, written c++
OOT
- Notes For OOT (c,c++) programs and examples or them PPTS of different-2 topics like inheritanse ,class object ,encapsulation , array,String . there are some examples of BFS,DFS,Best FS and there implementation code-Notes For OOT (c,c++) pro
map
- 数据结构 BFS DFS Prim kruscal dijkstra 代码-code of BFS DFS Prim kruscal dijkstra
BFS
- c语言广度优先搜索算法的实现，输入几个节点，生成树，然后经广度优先搜索算法输出-c language breadth-first search algorithm, enter the number of nodes, spanning tree, and then by the breadth-first search algorithm output
8puzzle
- this project solve puzzle 8 with bfs tr-this project solve puzzle 8 with bfs tree
graph
- Graph test-cmd: Basic functions: insert vertex, edge, batch insert, view adjacent matrix Advanced functions: print BFS tree, DFS tree, articulation points, bi-connected components and the one-way-bridge of a graph.-Graph test-cmd: Basic func
newton
- 非线性方程组的BFS秩2拟Newton方法MATLAB源代码-Nonlinear Equations BFS rank 2 Quasi Newton method MATLAB source code
Connect-Set
- 网易云课堂-陈越、何钦铭-数据结构-2016春 PTA-06-图1 列出连通集 给定一个有NNN个顶点和EEE条边的无向图，请用DFS和BFS分别列出其所有的连通集。假设顶点从0到N− 1N-1N− 1编号。进行搜索时，假设我们总是从编号最小的顶点出发，按编号递增的顺序访问邻接点。-Given a free E N vertices and edges of the graph, please list the set of all of its communicat
ACM
- ACM练习题 zju1024 zju1940 zju2097 pku2503toj2196 zju1091 zju1507 zju1649 graph bfs-ACM exercises zju1024 zju1940 zju2097 pku2503 toj2196 zju1091 zju1507 zju1649
BFS_graph
- 这是数据结构中图的广度优先算法的实现。广度优先算法是按照每个节点的拥有的孩子数目来进行遍历的。而不像图的深度优先算法是按照深层次，然后如果不能继续进入更深一层，就往回遍历。-BFS program of tree have a large of difference of the DFS program of trees.The produre of it is with the method of the children of a point ,rather than the depth o
oop-Week9
- 关于布线问题的一些代码,包括BFS 过程和回溯过程-Some code on wiring problems, including the BFS process and backtracking process