Follow the instructions here to complete this assignment.
- How is Breadth-first Search different in graphs than in trees? Describe the differences in your own words.
In a tree, Breadth-first Search, BFS, will go through each level of the tree individually. Meaning it will search all of the nodes at a specific depth before moving deeper into the tree. In a graph, BFS searches all neighbor vertices one edge distance away at a time. Meaning it will search all vertices at a certain edge distance from the starting vertex before it moves farther through the graph.
- What is one application of Breadth-first Search (besides social networks)? Describe how BFS is used for that application. If you need some ideas, check out this article.
BFS in a graph allows the program to find the shortest path between two vertecies by checking all of the neighbors and their children simultaneously, instead of down each path individually. This can be used to find relational data in statistics. For Example, how many actors link two actors together, or to follow along the path of a series of events.