Consider the following algorithm: Algorithm Reverse-delete for MST (Minimum spanning tree) Input: Full weighted copy of a graph G = (V, E) Output: For i = 1 to Edges == Vertices – 1:         G[i] = Find the largest edge         if G[i] does not break connection of the graph:                 delete largestEdge (G.remove[i])         else:                 keep largestEdge End for Return G

Use the shortest path algorithm to find the shortest path between vertex c and vertex m in Figure 4.1

Dijkstra's algorithm Consider the following graph. Let the start vertex bear, and the goal vertex be rg. Important: if a node has multiple outgoing edges, when the node is expanded the vertices adjacent to the node are processed in alphabetical order. Similarly, if multiple nodes in the OPEN queue have the same priority value, sort them by alphabetical order. I. 5 B 4 2 4- E 3 2 1- F 8 Ig 3- H 1. Show how the algorithm plans a path from r, to g. To display the various steps, follow exactly the same format used in the lecture notes (Example 4.4) and presented in class. 2. Show the tree produced by Dijkstra's algorithm at the end, together with the costs associated with each vertex.

Find the Minimum spanning tree of the below graph using Kruskals algorithm. You may refer to the class slides for algorithm. Clearly trace the working of the algorithm in your worksheet and upload the same as the solution.

List the vertices of the following graph in the order they will be visited by each of the following Graph traversal methods starting from vertex A: (a) Breadth-First Traversal: (b) Depth-First Traversal: Note: If at any time you have more than possible vertex to visit, you MUST visit them alphabetically. H. lick this link to disnlay it the imano doos not show utomatically hp EGO 814 LA 7614