a) Let G = (V, E) be a graph and let T = (VT, ET) be a BFS treeof G. Then the length of the path between the start vertex s and avertex v ∈ VT is called the level of v. Show that every non-treeedge of G in T runs in T between vertices in the same or insuccessive levels.
b) Let G = (V, E) be a graph, T = (VT, ET) a DFS tree of G and sthe starting vertex of T. Show: Both end vertices of an edge in E ET are in T on a path
PayPal Gateway not configured
PayPal Gateway not configured