Home > Graphs, Recursion, Hashmaps, Trees > Graphs, Recursion, Hashmaps, Trees > Introduction to Data Structures Show previous contentAre you sure you're getting this? Is this statement true or false?The breadth-first search (BFS) algorithm is used to traverse a graph in a depth-first manner.Press true if you believe the statement is correct, or false otherwise.TRUEFALSE Show following content