Recent questions tagged depth-first-search

0 votes
0 answers
33
Please give an example i didn't get itThe depth of any DFS tree rooted at a vertex is at least as much as thedepth of any BFS tree rooted at the same vertex.
0 votes
0 answers
34
3 votes
1 answer
35
Is following statement true/false? A DFS of a directed graph always produces the same number of tree edges, i.e., independent of the order in which vertices are considere...
0 votes
0 answers
39
How DFS(Depth First Search) modification is used to find whether a graph is planar or not ?
2 votes
0 answers
43
If we backtrack in DFS ,then doesn't statement 1 becomes true ?
2 votes
2 answers
44
If DFS algorithm applied starting from vertex ‘A’ which uses stack data structure then the height of stack is needed in worst case for DFS traversal is _________.
2 votes
1 answer
45
1 votes
0 answers
46
Choose the correct option, from the following:I) We can find the cycle in the graph using BFS.II) We can find the cycle in the graph using DFS.III)Both CorrectIV)Both wro...
0 votes
0 answers
48
1 votes
2 answers
51
6 votes
1 answer
52
0 votes
0 answers
55
0 votes
1 answer
56
Please someone explain ....A directed graph G is acyclic iff depth first search of G yields no back edges
0 votes
0 answers
60