Problem
Consider a directed graph, G=G(V, E). Using the provided edge set, E(u, v: w), where w is the weight of the edge, answer the following questions. E = ((A,B:1).(A,C:3),(B,D: 2).(D,C:-2)D,F:1).(D,H:5).(F,A:5).(F,M: 3) (F,H: 2).(H,M:1)]
I. Perform a breadth-first search (BFS) in the increasing order of weight when a source vertex is D. Tabulate the distance attribute (u.d) below. Explain if all vertices are visited. Is there any case BFS will not visit all vertices in any general graph. If so explain when.
II. Perform a depth-first search (DFS) in the increasing order of weight and report the attributes, discovering time (d) and finishing time (f), for each vertex. Let the starting vertex be A. If the DFS needs to restart from a new source, u, let the new source be in the increasing order of the vertex.