Given the relation 1 3 2 0 2 1 2 2 3 1 3 2 3 3 which of the

Given the relation. {(1, 3), (2, 0), (2, 1), (2, 2), (3, 1), (3, 2), (3, 3)}. which of the following would be a valid path on it\'s directed graph? 2, 2, 1. 3. 3, 1. 1, 2, 3, 3, 3 1, 3. 3, 1, 3, 2, 0 2, 1. 3. 2, 0. 1, 3 0. 1, 3, 2, 2, 2, 3, 3

Solution

Given the edges last option 0,1,3,2,2,2,3,3 is not a valid option because there is no edge with starting vertex 0.

Same goes for option 2,1,3,2,0,1,3 because once we cannot go from 0 to anywhere else hence it is not a valid option .

Second option 1,3,3,1,3,2,0 is a valid option below is the path

(1,3) -> (3,3) -> (3,1) -> (1,3) -> (3,2) -> (2,0)

first option 2,2,1,3,3,1,1,2,3,3,3 is not a valid path because

(2,2) - > (2,1) - > (1,3) -> (3,3) - > (3,1) -> Now to go to 1 from 1 we dont have a self loop from 1 to 1 hence it is not a valid option.