### Problem 1 Consider the following algorithm to check connectivity of a graph defined by its adjacency matrix. срр Algorithm Connected(A[0..n-1, 0..n-1]) { 7/Input: Adjacency matrix A of an undirected graph G //Output: 1 (true) if G is connected and 0 (false) if it is not if n 1 return 1; // //one-vertex graph is == connected by definition else { if not Connected (A[0..n-2, 0..n-2]) return 0 else { for j if A[n-1, j] return 1; } return 0; } } } 0 to n - 2 do {

Kruskal's minimum spanning tree algorithm is executed on the following graph. Select all edges from edgeList that belong to the minimum spanning tree. edgeList result List AD BC BE CF EF DG EG EH GH D 7 9 G 1 B 5 3 A E H 4 2 6 8 F

Alert dont submit AI generated answer.   Write a program that reads a weighted graph and an initial vertex.The program must print on the screen the minimum paths obtained by Dijkstra's algorithm. Input: Receives n, m and s; n is the total number of vertices, m the total number of arcs and s is the initial vertex.Next, m lines, each line with a trio of integers, corresponding to the beginning and end of the arc, followed by the weight of the arc.(Vertices are identified from 0 to n-1.) Output: Prints the shortest paths obtained by Dijkstra's algorithm. Exemple: Input: 5 10 00 1 100 4 51 2 11 4 22 3 43 2 63 0 74 1 34 2 94 3 2 Output: [0, 8, 9, 7, 5][-1, 4, 1, 4, 0]

Computer science question help