breadth first search algorithm for graph
Data Structure Notes

Breath First Search Algorithm

Breadth First Search Algorithm The Breadth First Search algorithm is a systematic search algorithm for graph or tree data structures. Breadth-first Search is sometimes also known as breadth-first traversal. Questions based on the Breadth First Search algorithm are generally asked in the GATE(CS) and UGC NET exams every year. GATE and UGC aspirants are suggested to prepare this topic very […]