Chapter 31

Question 1

Can we solve mazes using depth first algorithm

Answer 1

Yes

Question 2

What is DFS timestamp structure

Answer 2

Using depth first structure with time logs with the help of global counter.

Question 3

What we called to multiple trees

Answer 3

Forest

Question 4

What is back edge in directed graph

Answer 4

(u, v) where v is ancestor of u in the tree

Question 5

What is forward edge in directed graph

Answer 5

(u, v) where v is descendant of u in the tree

Question 6

What is cross edge in directed graph

Answer 6

(u, v) where u and v both are nor ancestor neither descendant of each other