10 votes 10 votes Which of the following data structure is useful in traversing a given graph by breadth first search? Stack Queue List None of the above Algorithms isro2017 data-structures graph-algorithms breadth-first-search easy + – Arjun asked May 9, 2017 Arjun 13.2k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply venkat_sirvisetti commented May 10, 2017 reply Follow Share But sir, both queue and list can be used for performing BFS. –1 votes –1 votes Devshree Dubey commented May 10, 2017 reply Follow Share @Sir Arjun, D Graph being a Directed, With Loops, A simple one or Non Directed???. :D :) 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes simply queue by choise abhishek tiwary answered Jun 30, 2017 abhishek tiwary comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes BFS uses queue sandeepjkh answered Aug 26, 2017 sandeepjkh comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes B - Queue. kp_12 answered Sep 12, 2017 kp_12 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Ans: It can be Queue or List but most appropriate is QUEUE rishu_darkshadow answered Sep 16, 2017 rishu_darkshadow comment Share Follow See all 0 reply Please log in or register to add a comment.
