Output of a depth-first search[edit]The four types of edges defined by a spanning treeA convenient description of a depth-first search of a graph is in terms of a spanning tree of the vertices reached during the search. Based on this spanning tree, the edges of the original graph can be divided into three classes: forward edges, which point from a node of the tree to one of its descendants, back edges, which point from a node to one of its ancestors, and cross edges, which do neither. Sometimes tree edges, edges which belong to the spanning tree itself, are classified separately from forward edges. If the original graph is undirected then all of its edges are tree edges or back edges. - Study24x7
Social learning Network
19 Mar 2019 11:57 AM study24x7 study24x7

Output of a depth-first search[edit]The four types of edges defined by a spanning tree


A convenient description of a depth-first search of a graph is in terms of a spanning tree of the vertices reached during the search. Based on this spanning tree, the edges...

See more

study24x7
Write a comment
Related Questions
500+   more Questions to answer
Most Related Articles