Problem:
Question 1: What graph traversal algorithm uses a queue to keep track of vertices which need to be processed?
Question 2: What 2 properties must a simple graph have?
Question 3: Suppose you have a directed graph representing all the flights that an airline flies. What algorithm might be used to find the best sequence of connections from one city to another?
I dont need long explanation. Just few sentences of expanation.