CIL17

Question

Comments

Its seems to be only one path 1-3-2-4

---

There answer is wrong.

---

my ans is option 3

plz verify !!!

---

path is alternating sequence of vertices and edges starting and ending with a vertex.

Source: Algorithm Design by Eva Tardos, Chapter Graphs

Enumeration of all paths gives 4 number of paths .

Answer 1

No, the answer is 4 only

and it is because path are :-

1. 1 -> 3 -> 2 -> 4;

2. 1 -> 4 -> 1 -> 4;

3. 1 -> 4 -> 2 -> 4;

4. 1 -> 3 -> 1 -> 4;

Hence answer is 4.

Comments

As far I know path is an open walk in which vertices are not repeated. If that is true answer will be only one 1-3-2-4

---

I agree with you