Write an algorithm for Breadth First Search (BFS) traversal of a graph.

Sure, here is a simple algorithm for Breadth First Search (BFS) traversal of a graph:

1. Start by picking any node, often we start with the root or any random node, mark it as visited and put it into a queue.

2. While the queue is not empty, repeat the following steps:

   a. Remove the first node of the queue.

   b. Mark it as visited.

   c. Visit all of its neighbors. For each unvisited neighbor, mark it as visited and add it to the queue.

3. If the queue is empty, you've visited all nodes that can be reached from the starting node.

This algorithm ensures that you visit each node in the graph once, and only once. The 'visited' marking is necessary to avoid visiting the same node more than once and possibly getting into an infinite loop.

Sure, here is a simple algorithm for Breadth First Search (BFS) traversal of a graph:

1. Start by picking any node, often we start with the root or any random node, mark it as visited and put it into a queue.

2. While the queue is not empty, repeat the following steps:

   a. Remove the first node of the queue.

   b. Mark it as visited.

   c. Visit all of its neighbors. For each unvisited neighbor, mark it as visited and add it to the queue.

3. If the queue is empty, you've visited all nodes that can be reached from the starting node.

This algorithm ensures that you visit each node in the graph once, and only once. The 'visited' marking is necessary to avoid visiting the same node more than once and possibly getting into an infinite loop.