0 0 votes HOW CAN WE GET A CROSS EDGE WHILE PERFORMING A BFS ON UNDIRECTED AND DIRECTED GRAPH CAN ANYONE SHOW WITH AN EXAMPLE? Programming in C breadth-first-search algorithms graph-algorithms + – codingo1234 763 views answer comment Share Follow Print See 1 comment 1 1 comment reply Shaik Masthan commented Nov 21, 2018 reply Follow flag this may help you https://gateoverflow.in/235758/breadth-first-search 1 1 replyShare Please log in or register to add a comment.
0 0 votes here E->B is a cross edge for a directed as well as undirected BFS tree. amitgy04 answered Jun 12, 2021 amitgy04 comment Share Follow 0 reply Please log in or register to add a comment.
