Graph Searching 7 Example of Edge Classification

[@Munto-Z]

Thank you so much, professor. You have no idea how much time you've saved me.

[@tvishathakur8947]

This is the best example explanation of DFS according to the edge terminologies!! This channel is too underrated. Thanks a ton prof :D

[@iitmotivationwithrahullson5930]

Nyce explanation

[@DINGFULU]

Explain the DFS Edge Classification in a short time, which is pretty good

[@saeedbaroody8103]

i think there is a mistake or something missing, how did he do the jump from q to r? shouldn't be a cross edge from q to r?? Also, q is already visited (marked red) and has a finishing time stamp too, meaning that he shouldn't have jumped from y to q, right? i think that the cross edge should have been from q to r . cross edge can be defined as such, it is the edge that connects a node of one tree to another node of another tree, since the DFS could give us a forest (collection of DFS trees) in a graph that might not be fully connected

[@MikeSieko17]

im sorry but the way you explained cross edge is not clear at all

[@markfanter3810]

Tree edges - edges found by the exploration Back edges - (u, v) where u is a descendent of v ( in this example, w is a descendent of s in the search) Forward edge - (u, v) where v is a descendent of u ( r, y ) Cross edge is any other edge that doesn't fit these definitions. q has not discovered y, so it cannot be a back edge, and it is obviously not a forward edge, hence it is a cross.