777 views
0 votes
0 votes
state TRUE or FALSE. and why

Running a DFS on an undirected graph G = (V;E) always produces the same
number of cross edges, no matter what order the vertex list V is in and no matter
what order the adjacency lists for each vertex are in.

Please log in or register to answer this question.

Related questions