Urgent Homework

- +1-617-874-1011 (US)
- +44-117-230-1145 (UK)

help@urgenthomework.com

Any traversal of a connected, undirected graph visits all the vertices in that graph. The set of edges which are traversed during a traversal forms a spanning tree. Fig. Graph G

For example, This Fig shows the spanning tree obtained from a breadth-first traversal starting at vertex b. Breadth-first spanning tree of G rooted at b

Similarly, This Fig shows the spanning tree obtained from a depth-first traversal starting at vertex c. Depth-first spanning tree of G rooted at c

## Follow Us