1 votes 1 votes Gate Ranker18 asked Apr 2, 2017 Gate Ranker18 2.5k views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Tesla! commented Mar 31, 2017 reply Follow Share Its seems to be only one path 1-3-2-4 0 votes 0 votes Tesla! commented Apr 2, 2017 reply Follow Share There answer is wrong. 0 votes 0 votes Gate Ranker18 commented Apr 2, 2017 reply Follow Share my ans is option 3 plz verify !!! 0 votes 0 votes Bikram commented Apr 9, 2017 reply Follow Share 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 . 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes 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. Shubhanshu answered Apr 1, 2017 Shubhanshu comment Share Follow See all 2 Comments See all 2 2 Comments reply anonymous commented Apr 2, 2017 reply Follow Share 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 0 votes 0 votes aehkn commented Apr 4, 2017 reply Follow Share I agree with you 0 votes 0 votes Please log in or register to add a comment.