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 ]

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 ]

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.

WHITE | GRAY | BLACK | |
---|---|---|---|

WHITE | Tree, Back | Tree, Back | None |

GRAY | Tree, Back | Tree, Back | Tree, Back |

BLACK | None | Tree, Back | Tree, Back |

52,345 questions

60,503 answers

201,884 comments

95,331 users