 |
Why you use DFS and BFS in graphs?In: Computer Games |
[Edit] |
[Edit] 
DFS and BFS are both searching algorithms.
DFS, or depth first search, is a simple to implement algorithm, especially when written recursively.
BFS, or breadth first search, is only slightly more complicated.
Both search methods can be used to obtain a spanning tree of the graph, though if I recall correctly, BFS can also be used in a weighted graph to generate a minimum cost spanning tree.
First answer by ID1276999292. Last edit by ID1276999292. Question popularity: 5 [recommend question]
Answers.com > Wiki Answers > Categories > Entertainment and Arts > Games and Toys > Video Games > Computer Games > Why you use DFS and BFS in graphs?
Our contributors said this page should be displayed for the questions below. (Where do these come from ) |
| If any of these are not a genuine rephrasing of the question, please help out and edit these alternates. |
What is bfs? Whate is bfs technology? Deference between dfs and bfs? Difference between DFS and BFS?
