0
Add your answer:
Earn +20 pts
Why you use DFS and BFS in graphs?
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.
Prove that if a DFS and BFS trees in graph G are the same than?
ok here we go...Proof:If the some graph G has the same DFS and BFS then that means that G should not have any cycle(work out for any G with a cycle u will never get the same BFS and DFS .... and for a graph without any cycle u will get the same BFS/DFS).We will prove it by contradiction:So say if T is the tree obtained by BFS/DFS, and let us assume that G has atleast one edge more than T. So one more edge to T(T is a tree) would result in a cycle in G, but according to the above established principle no graph which has a cycle would result the same DFS and BFS, so out assumption is a contradiction.Hence G should have more edges than T, which implies that if the BFS and DFS for a graph G are the same then the G = T.Hope this helps u......................
Who is faster between dfs and bfs?
dfs better then from bfs..
Difference between DFS and BFS?
1. bfs uses queue implementation ie.FIFO dfs uses stack implementation ie. LIFO 2. dfs is faster than bfs 3. dfs requires less memory than bfs 4. dfs are used to perform recursive procedures.
Am trying to find the solution to this question give a linear-time algorithm for a directed acyclic graph?
DFS, BFS
How can you design an algorithm to check if a given graph is connected?
Use a simple DFS/BFS traversal. If you have gone through all nodes, the graph is connected.
What is the algorithm DFS and BFS in graph traversal?
DFS and BFS stands for Depth First Search and Breadth First Search respectively. In DFS algorithm every node is explored in depth; tracking back upon hitting an already visited node and starts visiting from a node which has any adjacent nodes unvisited. In BFS, the nodes are visited level wise. These algorithms are used to traverse the nodes on a connected digraph. Primal
Why BFS is implemented using queue and DFS is implemented using stack?
yes pagal
Why is dfs better then from bfs?
It isn't necessarily better... They each have their own pros and cons
Dfs can be applied on undirected graph?
In an undirected graph there is no conception of depth.So DFS can not work without considering depth.
Why if dfs equal to bfs tree say call it T than G equal to T?
Prove_that_if_a_DFS_and_BFS_trees_in_graph_G_are_the_same_than
Differentiate graph with tree. Describe any one method of graph traversal?
Graph contains nodes and edges without following any rule.Whereas tree is a type of graph which must follow some rules.2 popular methods are BFS(breath first search),DFS(depth first search).If you could get any help from the answer then plz increase my trust point.
