0 votes 0 votes Which of the following statements are true? In a depth-first search of an undirected graph $G,$every edge of $G$ is either a tree edge or a back edge Forward and cross edges never occur in a depth-first search of an undirected graph A directed graph is acyclic if and only if a depth-first search yields no back edges $1$ $1$ and $2$ $2$ and $3$ All of these Algorithms algorithms graph-algorithms depth-first-search + – Lakshman Bhaiya asked Nov 13, 2018 • edited Dec 21, 2019 by Lakshman Bhaiya Lakshman Bhaiya 563 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Soumya Tiwari commented Nov 13, 2018 reply Follow Share Option D..? 0 votes 0 votes Lakshman Bhaiya commented Nov 13, 2018 reply Follow Share I don't know about $"$tree edge or a back edge and Forward and cross edges$."$ can you explain with an example, please? 0 votes 0 votes goxul commented Nov 13, 2018 reply Follow Share https://www8.cs.umu.se/kurser/TDBA77/VT06/algorithms/BOOK/BOOK2/NODE65.HTM#SECTION02442000000000000000 Refer this. 0 votes 0 votes Lakshman Bhaiya commented Nov 13, 2018 reply Follow Share Thank you 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes d In directed graph , no vertex visited twice means Acyclic graph then No back edges in directed graph means Acyclic graph. bhanu99999 answered Dec 20, 2019 bhanu99999 comment Share Follow See all 0 reply Please log in or register to add a comment.
