Unformatted text preview: u be the vertex on C which precedes v . u v C Since no vertex on C is discovered before v , at the time of discovery of v the vertices of C form a path from v to u consisting of white vertices. By the whitepath theorem, u becomes a descendent of v in some DFS tree. Therefore ( u , v ) is a back edge. ///...
View
Full
Document
 Spring '09
 AgoreBack
 Graph Theory, Vertex

Click to edit the document details