1. What’s a DAG? 2. Can a tree have cycles? 3. What evidence does the topo.java program (Listing 13.4) use to deduce that a graph has a cycle? 4. The weight in a weighted graph is a property of the...

1.
What’s a DAG?

2.
Can a tree have cycles?

3.
What evidence does the topo.java program (Listing 13.4) use to deduce that a

graph has a cycle?

4.
The weight in a weighted graph is a property of the graph’s _______.

5.
In a weighted graph, the minimum spanning tree (MST) tries to minimize

a.
the number of edges from the starting vertex to a specified vertex.

b.
the number of edges connecting all the vertices.

c.
the total weight of the edges from the starting vertex to a specified

vertex.

d.
the total weight of edges connecting all the vertices.