Exercises

0 / 10

A graph that does not have a path of length 3 or more that connects a node v to itself is:

0 / 10

The sequence of vertices v1...vn with edges connecting all the vertices is called:

0 / 10

Based on the adjacency matrix shown below, which of the following statements is true:

0 / 10

The adjacency matrix shown below is an accurate representation of the graph shown below.

0 / 10

On a breadth first search traversal of the graph shown below, and starting at node a, the first three nodes visited are:

0 / 10

On a depth first search traversal of the graph shown below, and starting at node a, the first three nodes visited are: