search
Log In
1 vote
249 views

Here i have option III is doubt.how option III always correct.one counter example is if i choose a tree where s is root node and v1& v2 are its child node then above question property i.e the vertices V1 and V2 that are simultaneously on the function call stack at some point during the execution of depth-first search from vertex s in a digraph is satisfies.but there is no any path from v1 to v2 or from v2 to v1.

in Algorithms
edited by
249 views
0

yup must not be true but may be true .

0
Sir may be true means False na.so ans should be option a.but here option is c.
0
yes a will be ans
0
why is III not always true??....
0
there may be no path from V1 to V2
0
@srestha, i think it should be,

can you give a counter example in which both are not connected to each other and still both of them are in the stack...?
0
have u read the example given by sahu?
0
okk, i was confused with simultaneous ... if they will be connected then no meaning of simultaneous, hence option A is true...
–1
the example given by @dileswar sahu is false as he has taken Tree but in question it mention directed GRAPH..hope it clear all your doubt
1
every tree is graph but graph need not tree.

Please log in or register to answer this question.

Related questions

1 vote
2 answers
2
450 views
Which of the following statement is true? For a directed graph, the absence of back edges in a DFS tree can have cycle. If all edge in a graph have distinct weight then the shortest path between two vertices is unique. 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. Both (a) and (c)
asked Jan 4, 2019 in Algorithms Abhishek Kumar 38 450 views
0 votes
0 answers
3
109 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.
asked Dec 26, 2018 in Algorithms CHïntän ÞäTël 109 views
...