MadeEasy Test Series 2018: Algorithms - Graph Algorithms

Question

A) S1 only

B) S1 and S2 only

C) S1 and S3 only

D) All statements are true.

Comments

C) S1 and S3 must be true.

S2 might be true.

---

pls explain your solution in detail.

---

In DFS

to push a,b from start vertex s. they should be neighbor of s.

Now to present a & b simultaneously into the stack, there should be at least one edge between both of them.