×

Which traversal algorithm is used in the breadth-first search (BFS) of a graph?

Which traversal algorithm is used in the breadth-first search (BFS) of a graph?

گراف کی چوڑائی پہلی تلاش (بی ایف ایس) میں کون سا ٹراورسل الگورتھم استعمال ہوتا ہے؟
Explanation
  • BFS uses level-order traversal, visiting all nodes at the current depth before moving to the next level.
  • It explores neighbors layer by layer.
  • This making it suitable for shortest path finding in unweighted graphs.