Question

in breadth first search of graphs which data type is used​

Answer 1

$\huge{\mathbb{\red{Answer}}}$

Rules of BFS Algorithm

A queue (FIFO-First in First Out) data structure is used by BFS. You mark any node in the graph as root and start traversing the data from it. BFS traverses all the nodes in the graph and keeps dropping them as completed.