Consider the following graph:
Which alternative corresponds to a possible DFS order of node visits?
a. A, B, D, F, E, C, G
b. A, B, C, D, E, F
c. A, C, D, B, E, F
d. G, C, A, B, C, D, F
e. None of the above
Instructions for question creators: (1) do not include the answer; (2) the last alternative must be: "E, None of the above"; (3) at the end, add "Original idea by: " and your name.
Suppose a graph \(G\) has the following second power of the adjacency matrix: $$ A^2 = \left( \begin{array}{cccc}1 & 0 & 1 & 1\...
No comments:
Post a Comment