BFS is an algorithm used for traversing or searching tree or graph data structures. BFS can be used to compute the maximum flow in a flow network, testing the bipartiteness of a graph. In mobile robotics, BFS can be particularly helpful in finding the shortest distance between two nodes, which in turn can be helpful in designing planning algorithms for autonomous movement. BFS starts at the tree root and explores all neighbor nodes at the present depth prior to moving on to the nodes at the next depth level.

For the assignment, use MATLAB and implement your own BFS algorithm using the graph provided. Document the results of traversing the graph starting from each of the six nodes. Part A$-$Pick any node, visit the adjacent unvisited vertex, mark it as visited, display it$,$ and insert it in a queue. Part B$-$If there are no remaining adjacent vertices left, remove the first vertex from the queue. Part C$-$Repeat step $1$ and step $2$ until the queue is empty or the desired node is found. Disclaimer: do not use high level functions of Matlab such as bfsearch$().$