1. ## Depth-first search and Breadth-first search

Ok I've attempted these can some one please check if I've done them right thanks

.
Depth first and

2. ## Re: Depth-first search and Breadth-first search

For depth-first (A is the root of the vertices in alphabetical order)...

A would connect to B, then C, then E, then F, then D, then H, then G, then I, then J, then K. Go back to J, connect J to L.

3. ## Re: Depth-first search and Breadth-first search

For depth-first; it looks like you went from F to J. F should of went to D.

4. ## Re: Depth-first search and Breadth-first search

For breadth-first; blue part looks right. Orange parts should be BE, CG, DF (one you missed), DH. This changes the remaining the connections.