Search - dfs stack

Search - dfs stack - List

[Other resource] ADS_DFS_Maze DL : 0: 采用stack算法的DFS搜索，有java做的界面，还有适当的注释-using stack DFS search algorithm, so java interface, the appropriate Notes
Date : 2008-10-13 Size : 11.06kb User : 黄丽雯
[Data structs] ADS_DFS_Maze DL : 0: 采用stack算法的DFS搜索，有java做的界面，还有适当的注释-using stack DFS search algorithm, so java interface, the appropriate Notes
Date : 2025-07-16 Size : 11kb User : 黄丽雯
[Data structs] DFSfunction DL : 0: DFS非递归函数函数功能：图的dfs的非递归算法(用堆栈实现) 输入：图的邻接矩阵输出：dfs序列 -DFS non-recursive function function function: dfs map non-recursive algorithm (using the stack to achieve) Input: adjacency matrix graph output: dfs sequence
Date : 2025-07-16 Size : 1kb User : sunshine
[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
Date : 2025-07-16 Size : 3kb User : 涂舒
[Data structs] AdjList DL : 0: a code to use DFS which is achieved with stack to search the map which is stored ine the adjList,this is my first time to practice the map
Date : 2025-07-16 Size : 2kb User : liangyi
[Data structs] dfs DL : 0: 深度优先搜索算法DFS的实现，1.如果有可能，访问一个领接的未访问的节点，标记它，并把它放入栈中。 2 当不能执行规则 1 时，如果栈不为空，则从栈中弹出一个元素。 3 如果不能执行规则 1 和规则 2 时，则完成了遍历。-Depth-first search algorithm DFS implementation, 1. If possible, visit a collar then outstanding access node, mark it and put it into the stack. 2 can not be performed when the rule 1, if the stack is not empty, pop an element from the stack. 3 If you can not implement rules 1 and 2, then the complete traversal.
Date : 2025-07-16 Size : 1kb User : 陈源
[Data structs] MY_DFS DL : 0: DFS is an uninformed search that progresses by expanding the first child node of the search tree that appears and thus going deeper and deeper until a goal node is found, or until it hits a node that has no children. Then the search backtracks, returning to the most recent node it hasn t finished exploring. In a non-recursive implementation, all freshly expanded nodes are added to a stack for exploration.
Date : 2025-07-16 Size : 1kb User : synthia
[Data structs] ZeroOne DL : 0: 求0，1序列的三种办法第一种：递归深度搜索第二种：栈结构深度搜索第三张：神秘方法-Three methods to solve 0-1 sequence 1st: recursive DFS 2st: DFS on stack construction 3st: sprytical..
Date : 2025-07-16 Size : 1kb User : forgeneral
[Data structs] Data-structure-course-design DL : 0: 上学期做的数据结构课程设计，走迷宫游戏，分别用了两种方法来实现：第一种方法，链栈的存储结构，用递归的dfs来实现第二种方法，回溯法求出所有通路，穷举求解法-On the data structure of the semester curriculum design, mazes game, respectively for the two methods to realize: The first method, chain stack the storage structure, with the recursive DFS to achieve The second method, back through the algorithm to find out all pathways, exhaustively method
Date : 2025-07-16 Size : 4kb User : 李国强
[Data structs] kcsj DL : 0: 数据结构课程设计的，选存储结构,输入含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”； -Data structures course, choose the storage structure, input containing n vertices vertex (character) and e edges in the graph G (2) Find the degree of each vertex, the output results (3) specify an arbitrary vertex xinitial vertex DFS traversal on the graph G, the output DFS sequence of vertices (hint: use a stack to achieve DFS) (4) specify an arbitrary vertex x is the initial vertex for BFS traversal of a graph G, the output the BFS vertex sequence (Hint: achieve the BFS uses a queue) (5) input vertices x, find the graph G: If the vertices containing x, then delete the node connected with the side, and for the DFS traversal (perform operations) otherwiseoutput "x" (6) to judge a graph G is a connected graph, output "yES"/"nO"
Date : 2025-07-16 Size : 223kb User : 王俊超
[AI-NN-PR] prolog-DFS DL : 0: 在用prolog来实现DFS算法，基本思想是使用回溯和stack-Using the DFS in Prolog
Date : 2025-07-16 Size : 14kb User : 霍锋
[Data structs] prolog-BFS DL : 0: 在用prolog实现BFS算法，基本思想不同于dfs是bfs使用queue而不是stack-Using BFS in prolog
Date : 2025-07-16 Size : 15kb User : 霍锋
[Linux-Unix] Glyph DL : 0: An Fst state s DFS stack state.Performs depth-first visitation. Visitor class argument determines actions and contains any return data. ArcFilter determines arcs that are considered.
Date : 2025-07-16 Size : 3kb User : pzvengven