MathJax


Monday, April 12, 2021

2021-020

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

 

Original idea by: Wandersom Moura

No comments:

Post a Comment

2026-318

Suppose a graph \(G\) has the following second power of the adjacency matrix: $$ A^2 = \left( \begin{array}{cccc}1 & 0 & 1 & 1\...