Jump to content

Recommended Posts

Posted

the adjacency list representation of a graph G, which has 7 vertices and 10 edges is,

a:- d,e,b,g

b:- e,c,a

c;- f,e,b,d

d:- c,a,f

e:- a,c,b

f:- d,c

g:- a

1. show the tree produced by depth first search when it is run on the graph G, using vertex a as the source

2. In the DFS of item 1, show the edges of the graph G which is not present in DFS tree by dashed line

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.