DSSZ
www.dssz.org
Search
Sign in
Create an account
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - bfs
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Search - bfs - List
【
Data structs
】
USACO3.2.5
DL : 0
【USACO3.2.5】魔板 ,经典ACM题,采用BFS-[] USACO3.2.5 magic board, ACM Classic title, the use of BFS
Update
: 2024-05-02
Size
: 1024
Publisher
:
liziyu
【
Mathimatics-Numerical algorithms
】
exBFS
DL : 0
八数码,是经典的ACM题目中, 采用BFS的例子-Eight digital, ACM is a classic topic, using the example of BFS
Update
: 2024-05-02
Size
: 1024
Publisher
:
liziyu
【
Data structs
】
DSchen
DL : 0
二叉树建立,先序,中序,后序遍历,图的DFS,BFS演示程序,不断更新中,欢迎提建议-Tree establishment, the first order, in sequence, after the traversal, graph DFS, BFS presentation procedures, constantly updated, welcomed the proposals
Update
: 2024-05-02
Size
: 2078720
Publisher
:
emacochen
【
Data structs
】
code
DL : 0
1、猴子选大王 2、约瑟夫环 3、迷宫求解 4、回文游戏 5、地图四染色问题 6、八皇后问题 7、原四则表达式求值 8、k阶斐波那契序列 9、遍历二叉树 10、编写DFS算法的非递归函数。 编写BFS算法。 11、简单选择排序, 折半插入排序, 冒泡排序, 快速排序, 堆排序 12、顺序查找,折半查找-err
Update
: 2024-05-02
Size
: 34816
Publisher
:
isxzh
【
Data structs
】
TDJB
DL : 0
1)自选存储结构,输入含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是否是连通图,输出信息“YES”/“NO”; (7)如果选用的存储结构是邻接矩阵,则用邻接矩阵的信息生 成图G的邻接表,即复制图G,然再执行操作(2);反之亦然。 -err
Update
: 2024-05-02
Size
: 242688
Publisher
:
迟浩东
【
source in ebook
】
BFS_Demo
DL : 0
Demo s algorithm BFS
Update
: 2024-05-02
Size
: 19456
Publisher
:
vohaidang
【
Windows Develop
】
BFS(Release20080704)
DL : 0
pb和flash直接通信,用pb程序来控制flash动画-pb and the flash direct communications, pb procedures used to control the flash animation
Update
: 2024-05-02
Size
: 5891072
Publisher
:
李国鑫
【
Data structs
】
zoj_1004_Anagrams_by_Stack
DL : 0
zoj 1004 的题目,这是一个经典的水壶倒水问题,题目中没有要求最少的次数倒满水,所以还可以不用bfs,本题用了bfs-zoj 1004 topics, this is a classic problem of water pouring money down the drain, the title does not require a minimum number of filling water, so it can be bfs, the title used bfs
Update
: 2024-05-02
Size
: 1024
Publisher
:
Scott
【
Mathimatics-Numerical algorithms
】
ACM_ICPC_Search__By_ACMaryland
DL : 0
ppt about search(bfs && dfs) used in ACM_ICPC
Update
: 2024-05-02
Size
: 538624
Publisher
:
HuaXiong
【
Data structs
】
maze_dfs
DL : 0
solve maze with dfs and bfs
Update
: 2024-05-02
Size
: 51200
Publisher
:
melody
【
Data structs
】
4.1
DL : 0
采用图的邻接表作为图的存储结构,完成有向图和无向图的DFS和BFS操作-The use of maps as a chart table adjacent to the storage structure, the completion of directed graph and undirected graph operations of DFS and BFS
Update
: 2024-05-02
Size
: 104448
Publisher
:
陈赟
【
Other
】
disanti
DL : 0
(1)自选存储结构,输入含n个顶点(用字符表示顶点名称)和e条边的图G; (2)指定任意顶点x为初始顶点,对图G作DFS遍历,输出DFS(深度优先)顶点序列(提示:使用栈实现DFS); (3)指定任意顶点x为初始顶点,对图G作BFS(广度遍历),输出BFS顶点序列(提示:使用队列实现BFS); (5)输入顶点x,查找图G:若存在含x的顶点,则删除该结点及与之相关连的边,并作DFS遍历(执行操作3);否则输出信息“不存在x”; (6)判断图G是否是连通图,输出信息“YES”/“NO”; (7)如果选用的存储结构是邻接矩阵,则用邻接矩阵的信息生成图G的邻接表-(1) on-demand storage structure, input containing n vertices (with characters in the name of that vertex) and e edges of the graph G (2) specify arbitrary vertex x as the initial vertex of the graph G for the DFS traversal, output DFS (depth-first) vertex sequence (Hint: Use the stack to achieve DFS) (3) specify arbitrary vertex x as the initial vertex of the graph G for the BFS (breadth traversal), the output sequence of BFS vertex (hint: the realization of the use of queue BFS) (5) input vertex x, find graph G: If there is a vertex with x, then the deletion of the nodes and edges associated with them, and DFS traversal (3 steps) Otherwise output "does not exist x" (6) to determine whether graph G is a connected graph, output "YES"/"NO" (7) If I choose the storage structure is the adjacency matrix, the adjacency matrix of the information used to generate the adjacency list graph G
Update
: 2024-05-02
Size
: 3072
Publisher
:
涂舒
【
Data structs
】
LTDT5
DL : 0
demo BFS,DFS algorithm
Update
: 2024-05-02
Size
: 108544
Publisher
:
torai
【
Data structs
】
ZOJ1055-Oh_Those_Achin_Feet
DL : 0
ZOJ 1055 Oh, Those Achin Feet.bfs求最短路径. -ZOJ 1055 Oh, Those Achin ' Feet.bfs seek the shortest path.
Update
: 2024-05-02
Size
: 1024
Publisher
:
高海东
【
Windows Develop
】
BFS
DL : 0
無向圖+array of linked list製成 歡迎參考-nondirected, array of linked list
Update
: 2024-05-02
Size
: 2048
Publisher
:
liao
【
Windows Develop
】
shixiantudebianli
DL : 0
MatToList(MGraph g,ALGraph *&G):将邻接矩阵g转换成邻接表G。 ListToMat(ALGraph *G,MGraph &g):将邻接表G转换成邻接矩阵g。 DispMat(MGraph g):输出邻接矩阵g。 DispAdj(ALGraph *G):输出邻接表G。 DFS(ALGraph *G,int v):以递归的方法从顶点v深度优先遍历图G。 DFS1(ALGraph *G,int v):以非递归的方法从顶点v深度优先遍历图G。 BFS(ALGraph *G,int v):从顶点v广度优先遍历图G。 - MatToList (MGraph g, ALGraph* & G): the adjacency matrix adjacency list g into G. ListToMat (ALGraph* G, MGraph & g): the adjacent table adjacency matrix G into g. DispMat (MGraph g): output adjacency matrix g. DispAdj (ALGraph* G): output adjacency list G. DFS (ALGraph* G, int v): to the method of recursive vertex v from the depth-first traversal graph G. DFS1 (ALGraph* G, int v): non-recursive method to vertex v from the depth-first traversal graph G. BFS (ALGraph* G, int v): vertex v from the breadth-first traversal graph G.
Update
: 2024-05-02
Size
: 3072
Publisher
:
小鬼
【
Data structs
】
DFS-BFS
DL : 0
BEST FIRST SEARCH AND DEEP FIRST SEARCH
Update
: 2024-05-02
Size
: 650240
Publisher
:
Suniaraharja
【
Data structs
】
ada4
DL : 0
bfs,counting sort ,dijaksta ,and many more for ada
Update
: 2024-05-02
Size
: 5120
Publisher
:
saurabhsingh
【
Mathimatics-Numerical algorithms
】
Graph_Traversal_DFS_and_BFS
DL : 0
Graph Traversal,DFS and BFS
Update
: 2024-05-02
Size
: 1024
Publisher
:
mn008
【
Other
】
DFS
DL : 0
图论编程,包含文件操作,建立图的邻接表,并实现深度优先搜索-Graph theory programming, including file operations, the establishment of plans of the adjacent table, and the depth-first search
Update
: 2024-05-02
Size
: 6144
Publisher
:
«
1
2
...
4
5
6
7
8
9
10
11
12
13
14
...
20
»
DSSZ
is the largest source code store in internet!
Contact us :
1999-2046
DSSZ
All Rights Reserved.