1. Use the graph below to answer the following questions. A 5 B H 10 G 10 25 20 50 5 5 30 15 5 E 15 C 20 F (a) Use Kruskal's Algorithm to produce a minimum spanning tree. Write down the edges that you choose in order of the algorithm. D

Q1 )  Run Kruskal's algorithm on the above graph. (Kruskal's alg. is the greedy approach.) What is the weight of the last edge added to the MST constructed by Kruskal's algorithm? options : a) 1 , b) 2 , c) 3 , d) 5   Q2 )  Run Prim's algorithm on the above graph, starting from vertex E. (Prim's alg. is similar to Dijkstra's alg. The tiebreaker for the other edges/vertices after setting s=E doesn't matter for this question, you should get the same answer for any choice when there is a tie.) What is the weight of the last edge added to the MST produced by Prim's algorithm? options : a) 1 , b) 2 , c) 3 , d) 5

Can you give me the java code for the following

9:17 Today Edit 9:17 AM Given a directed graph G=(V, E), design an algorithm to find out whether there is a route between two nodes, say, u and v. Your design should be based on depth first search and should be given in pseudo code.

Determine the order of graph traversal using DFS starting from F with clockwise direction!

First picture is assignment I need help with, second picture is my code from assignment 17. Using python

Please how do i solve this?

c) Given the following Graph and after applying Dijkstra algorithm, the final table looks as given below. 16 10 11 12 XXX H 4 18 Fr Vertex known d. T A 7 B T 0 15 H 19 C 41 M J B C D E F G I J JJ K L M T T T T T T T T T T T 6 2 20 5 7 14 31 P G 10 K 30 D G J K T 10 560 From this information, find out the shortest path from the source vertex B to vertex I, trace the path and also find out the shortest distance.

7. Consider the following graph: A 14 CO D 9 E C 12 10 17 b) What is the weight of the minimum spanning tree? B Apply Kruskal's algorithm to find the minimum spanning tree. Edges are sorted first by length, and in the event of a tie, by name, where the two letters are in alphabetical order. Use makeset (x), find (x), and union (x, y) to determine if there are cycles. a) Circle the edges that are part of the minimum spanning tree. AC, AD, AE, BC, BD, BE, DE c) Draw the tree that results from applying the union-find algorithm for cycle detection. When drawing the tree, put vertices with lower letters in the left subtrees so that all the vertices in a level are sorted alphabetically from left to right

c) Form a binary search tree from the numbers given below using natural order (large number on right), inserting the numbers in the order they appear. 5, 10, 6, 18, 3, 2, 20 d) Use a depth-first search to find a spanning tree of the following graph. Start at the vertex a, and use alphabetical order. b d a f g с h i e