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 ]