Question 23
Is every vertex of a graph included in each of the following?
depth first traversal
[Choose]
breadth first traversal
[Choose]
topological ordering
[Choose]
Question 24
3 pts
1 pts
Assume you were creating a directed graph to represent data in the real world. In
this graph, the vertices represent cities in the United States. The edges represent
direct flights between cities. In other words, if there is an edge from Vertex A to
Vertex B, that means there is a direct flight that goes from City A to City B. If there
is no direct edge from Vertex M to Vertex N, that means there is no direct flight
that goes from City M to City N.
Think about what this graph would look like if it used real-world data. Would the
graph be complete?
Yes, the graph would be complete.
No, the graph would NOT be complete.