2.Show the order in which the vertices in graph G are visited using the DFS algo

Question

2.Show the order in which the vertices in graph G are visited using the DFS algorithm and the BFS algorithm. G = (V,E) where V = {a, b, c, d, e, f, g} and E = {(a,b), (a,c), (b,d), (c,e), (d,f), (e,f), (e,g)}. Start at vertex a and check edges in alphabetical order.

3.Give a topological sort for the following relations: (a<b, a <c, d<b, e<c, a<e, a<d).

4.Using any resources known to you, investigate and report on two of the following algorithms: 1) Dijkstra's, 2) Bellman-Ford's, 3) Floyd-Warshall's. In each report, give a description in your own words of i) the purpose of the algorithm, ii) the problem solving technique used, and iii) the reported complexity and efficiency of the algorithm. Be sure to cite all sources used including web pages. For each of your chosen algorithms, attach a copy of the best (in your opinion) web site that you found most helpful and understandable in describing the algorithm.

Explanation / Answer

Solution:

Note: Multiple questions asked, please post the questions separately

2.

DFS:

BFS:

Related Questions

Navigate

• Browse (All)
• Browse 2
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.