# MadeEasy Test Series: Algorithms - Graph Algorithms

405 views

Which of the following statement is true?

1. For a directed graph, the absence of back edges in a DFS tree can have cycle.
2. If all edge in a graph have distinct weight then the shortest path between two vertices is unique.
3. The depth of any DFS (Depth First Search) tree rooted at a vertex is atleast as depth of any BFS tree rooted at the same vertex.
4. Both (a) and (c)

edited

I think the correct answer is option c.

Because if a DFS traversal graph consists of a back edge then it has a cycle. and option a is mentioning just the opposite.

And 2 paths can have the same length like 7+3=10 and 6+4=10.
0
what about forward edge ? we can make cycle with na ...... backedge is sufficent but not necessary
1
A graph has a cycle if and only if there is a back edge.

A forward edge can never lead to a cycle.
0
okk okkk i m wrong there directions are not in cycle form
1 vote
1. A directed graph can have cycle only when it has back edge in DFS tree. So it is FALSE.

2. The distance between two vertices may be same using the different paths. Also, no of edges in those paths may vary. So this statement is also FALSE.

3. BFS distance from source is the minimum number of edges to reach the target node. In DFS, the depth of any node will surely be greater than or equal to minimum number of edges from the source. Hence, this statement is TRUE.

## Related questions

1
103 views
According To Me Answer Should Be 6… Anyone Please Try Once!!! Given Is 5 With No Explaination !!!! like 11-12-12 then for second square 4 times 13 so c(4,2) any two of then lead to me @ answer @6.
1 vote