Question: The 2-D array A of floating point values representing the adjacency matrix of a weighted non-directed graph with N vertices is input to the following
The 2-D array A of floating point values representing the adjacency matrix of a weighted non-directed graph with N vertices is input to the following algorithm:
![ALGORITHM Enigma (A[0..N - 1,0..N - 1]) //Input: A matrix A[0..N-1, 0..N-1]](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2022/08/6308ad3dbb812_0216308ad3da43f3.jpg)
- What is the objective of this algorithm?
- Find T(N) = number of array element comparisons + number of arithmetic operations needed to return the result.
- Find the best and worst case complexities of this algorithm in terms of N.
ALGORITHM Enigma (A[0..N - 1,0..N - 1]) //Input: A matrix A[0..N-1, 0..N-1] of floating point values { } for i=0 to N-1 { D = 0; for j=0 to N-1 {if ( A ! = 0) D = D +1; } if (D
Step by Step Solution
3.57 Rating (164 Votes )
There are 3 Steps involved in it
Objective of the Algorithm The algorithm checks whether the given graph is connected It iterates ove... View full answer
Get step-by-step solutions from verified subject matter experts
