Share
Explore BrainMass

Depth First Search

Hi

I would appreciate if you could say if the statement below is TRUE or FALSE and explain why.

Given a graph G, we might start a DFS from two different vertices, u and v. Any back edge in the DFS starting from u is also a back edge in the DFS starting from v.

Solution Summary

Depth First Search is evaluated.

$2.19