390 likes | 501 Views
Graph Traversal. s. s. Notice that the . s. discovery edges . spanning . form a . tree . of the . connected . component of the . starting vertex . . s. Recall that a . spanning tree. is a . spanning subgraph. that is a tree. spanning subgraph. A .
E N D
Notice that the s discovery edges spanning form a tree of the connected component of the starting vertex . s Recall that a spanning tree is a spanning subgraph that is a tree. spanning subgraph A is a subgraph that contains all the vertices of the graph.