depth-first-search
Question about breadth-first completeness vs depth-first incompleteness
According to Norvig in AIMA (Artificial Intelligence: A modern approach), the Depth-first algorithm is not complete (will not always produce a solution) because there are cases when the s开发者_如何学[详细]
2023-02-12 15:25 分类：问答Fastest way to traverse arbitary depth tree for deletion?
For my own exercises I\'m writing an XML-parser. To fill the tree I use a normal std::stack and push the current node on top after making it a child of the last top-node (should be depth-first?). So I[详细]
2023-02-11 12:24 分类：问答Why do I get StackOverFlowError when trying to DFS this graph?
I am trying to write an algorithm that determines whether a graph is connected or not. I think my code is almost correct, although I keep getting StackOverFlowError. I personally think because there\'[详细]
2023-02-11 08:09 分类：问答What does it mean to expand a node?
I\'m trying to understand the algorithm for a Depth-Limited-Search on wikipedia, and I\'m trying to figure out what exactly it means to expand a node. I attempted to search for an answer but all I got[详细]
2023-02-10 01:29 分类：问答sort predicate to have nodes sorted in Depth First Search order
I have a list of nodes, where each of the nodes belong to one or multiple trees.(they do not necessarily share a common ancestor)[详细]
2023-02-07 01:14 分类：问答Java: Solving 15 Puzzle using Fitness functions
I am currently working on a project to solve a 15 Puzzle using fitness functions. There are 3 kinds of fitness functions that can be used,[详细]
2023-02-06 20:10 分类：问答Using boost::depth_first_search with Visitor
As the title suggests, I\'m using boost::depth_first_search and using a Visitor (inheriting from boost::default_dfs_visitor) to implement some algorithm.[详细]
2023-02-04 19:47 分类：问答.NET Performance: Deep Recursion vs Queue
I\'m writing a component that needs to walk large object graphs, sometimes 20-30 levels deep. What is the most performant way of walking the graph?[详细]
2023-02-04 05:46 分类：问答Performing depth-first algorithm from a specific vertex
I am trying to find a way to perform the depth-first algorithm from a specific vertex by using the boost graph library.[详细]
2023-02-03 14:29 分类：问答java - Depth First Search - Perform DFS on a tree
Im trying to perform DFS on a Minimum Spanning Tree which contains 26 nodes. Nodes are named \'A\' to \'Z\' and the tree is undirected.[详细]
2023-02-01 12:17 分类：问答
![Interactive visualization of a graph in python [closed]](https://www.devze.com/res/2023/04-10/09/92d32fe8c0d22fb96bd6f6e8b7d1f457.gif)
加载中,请稍侯......