breadth-first search the breadth-first search algorithm starts at nodechooses that node or vertex as its root nodeand visits the neighboring nodesafter which it explores neighbors on the next level of the graph consider the following diagram as graphthe diagram is an example of an undirected graph we continue to use this type of graph to help make explanation easy without being too verbose the adjacency list for the graph is as followsgraph dict(graph[' '[' '' '' 'graph[' '[' '' '' 'graph[' '[' '' 'graph[' '[' '' 'graph[' '[' '' 'graph[' '[' '' '' 'graph[' '[' '' 'graph[' '[' 'in trying to traverse this graph breadth firstwe will employ the use of queue the algorithm creates list to store the nodes that have been visited as the traversal process proceeds we shall start our traversal from node