搜索资源列表
duliu
- 对以邻接矩阵为存储结构的图进行 DFS和 BFS遍历. -Adjacency matrix of the storage structure of the graph for the DFS and BFS traversals.
erchashu
- 本文利用C语言实现了简单的二叉树,每个结点只保存一个整数,并且,由于非常简单,树的根结点是确定的,而不是输入的。确定根结点以后,用户输入的每一个数都被insert到树中(-999表示停止),利用深度优先的方法。建立好二 叉 树以后,分别利用深度优先(DFS)和广度优先(BFS)进行了遍历, -In this paper, a simple C language binary tree, each node only stores an integer, and, due to the very
8puzzle-49726044
- DFS&BFS for 8puzzl 實作 內容有兩個檔案-DFS & BFS for 8puzzl implement the contents of two files
BFS
- 首先因為要判斷是否符合圖的標準,當符合時就先讓最少的邊都先連到,然後再將多餘的邊放入,這樣就可以形圖一個基本的圖,而在產生圖的過程,我是分成兩個陣列做判斷,一個是已放一個是未放的方式來產生,最後再用push_back()來做串列,list我是list<int>::iterator it ,並且判斷開始begin() 和結束end()以防止出錯-To determine whether the first, because the standard map, when consiste
EightPuzzle
- BFS for EightPuzzle problem. Project done in NetBeans
BFS-v1.1
- 这是我写的人工智能的九宫问题,用广度优先搜索实现,效率不高。-This is my problem writing artificial intelligence Nine-palace, with breadth-first search to achieve efficiency is not high.
BFS
- java 数据结构 实现图的广度优先算法-Data structure of breadth first search in java
fiifteen_puzzle
- Program implements graphs algorihtms to solve fifteen puzzle problem (http://en.wikipedia.org/wiki/Fifteen_puzzle). There are few methods BFS - Hamming and Manhattan heuristics, Breadth-first search and Depth-first search. You can implement A* algori
Open-the-Lock
- hdu 1195的AC代码。用的双向BFS,注释罗列了一些该注意的事情-hdu 1195 the AC code. With two-way BFS, note lists a number of things in the note
1482
- 中大sicily 1482代码,采用结构体的数据结构,C++描述-Zhongda sicily 1482 code, using BFS algorithm, C++ descr iption
CSharp---DFS-BFS
- 实现图的交互输入,可创建邻接表,还可进行深度优先遍历广度优先遍历,拓扑排序等-To achieve interactive map input, you can create adjacency table, but also for the breadth-first traversal depth-first traversal, topological sorting
dfsPbfs
- 数据结构,图的深搜和广搜。(DFS+BFS)-Data structures, graph search deep wide search. Data structures, graph search deep wide search. Data structures, graph search deep wide search.
BFS
- 广度优先搜索算法,是搜索算法的一种,内附实例-The breadth-first search algorithm
10CS30013_4
- GRAPH ALGORITHMS BFS ,FLOYD WARSHA-GRAPH ALGORITHMS BFS ,FLOYD WARSHALL
kcsj
- 数据结构课程设计的,选存储结构,输入含n个顶点(用字符表示顶点)和e 条边的图G; (2)求每个顶点的度,输出结果; (3)指定任意顶点x为初始顶点,对图G作DFS遍历,输出DFS 顶点序列(提示:使用一个栈实现DFS); (4)指定任意顶点x为初始顶点,对图G作BFS遍历,输出BFS 顶点序列(提示:使用一个队列实现BFS); (5)输入顶点x,查找图G:若存在含x的顶点,则删除该结点及 与之相关连的边,并作DFS遍历(执行操作3);否则输出信 息“无x”; (6)判断图G是否是连通图,输出信
Graph-traversal
- 图的遍历示例。包括深度优先和广度优先。控制台程序。-Graph traversal.DFS and BFS.
bft.tar
- 对于BFT算法的一种实现,并实现了一个BFS(基于BFT算法的文件系统)-For an implementation of the BFT algorithm, and one of the BFS (BFT algorithm-based file system)
CatCatchMouse
- 回溯法求猫抓老鼠问题,要求输入m*n的地图,随机生成障碍物,求猫爪老鼠的路径-cat to find a way catch mouse by bfs
graphclaim
- 本源码实现了图的基本操作。BFS,DFS,邻接矩阵,邻接链表,矩阵变换,拓扑排序等。-This code is about Basic opereation of Graph.Such as BFS,DFS,adjacent-matrix/list matrixing and topical sort etc.