0 votes 0 votes Which does this sentence mean? In BFS of an undirected graph, there are no back edge and no forward edge. DS programming-in-c data-structures breadth-first-search + – syncronizing asked Aug 23, 2018 syncronizing 2.5k views answer comment Share Follow See 1 comment See all 1 1 comment reply Shaik Masthan commented Aug 23, 2018 reply Follow Share read the comments https://gateoverflow.in/235758/breadth-first-search 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Incase of Undirected Graph : BFS tree has no Back edge and forward edge . Only Tree edge and cross edges are there. In directed Graph : BFS tree has no forward edge. supreetshukla answered Jan 29, 2023 supreetshukla comment Share Follow See 1 comment See all 1 1 comment reply sayednumairVG commented Jan 21 reply Follow Share Thank you for your input, sir. 0 votes 0 votes Please log in or register to add a comment.