0
/ 1.0
A graph with relatively few edges is called:
CW_Graphs
Score: 0 / 10.0
Problems from chapter 11 on graphs and graph traversals
Exercises
0
/ 1.0
A graph with many edges is called:
0
/ 1.0
A graph that does not have a path of length 3 or more that connects a node v to itself is:
0
/ 1.0
A directed graph is one
0
/ 1.0
A complete graph is one which each pair of vertices:
0
/ 1.0
A DAG is:
0
/ 1.0
The sequence of vertices v1...vn with edges connecting all the vertices is called:
0
/ 1.0
Trees and lists are special cases of graphs.
0
/ 1.0
Based on the adjacency matrix shown below, which of the following statements is true:
0
/ 1.0
On a breadth first search traversal of the graph shown below, and starting at node a, the first three nodes visited are:
