The Gateway to Computer Science Excellence
+1 vote
Assume WHITE vertices that are yet to be discovered, BLACK vertices are finished vertices and GRAY vertices are frontier betweeen WHITE and BLACK in Depth First Search.

Now, What are the various edge types like TREE-EDGE and BACK-EDGE possible between any pair of vertices during a Depth First Search in an Undirected graph.

Confused about the edge type between WHITE and GRAY type vertices.

[ CLRS (3rd Edition) : 22-3:1; Page # 610 ]
in Algorithms by Junior (985 points)
edited by | 246 views

1 Answer

0 votes

An edge (u,v) is said to be TREE-EDGE if either u is ancestor of v or v is ancestor of u.
An edge (u,v) is said to be BACK-EGE if the edge between u and v discovered during the traversal from v to u.

If we can have a TREE-EDGE between any pair of types of vertices in an undirected graph, we can also have BACK-EDGE in that same pair of  types of vertices.

Possible types of edges in undirected graph during DFS at any stage
WHITE Tree, Back Tree, Back None
GRAY Tree, Back Tree, Back Tree, Back
BLACK None Tree, Back Tree, Back
by Junior (985 points)
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,313 answers
105,047 users