Question: Hello, Im trying to program warshalls algorithum in java but an running into an error can someone please help. Assume an N by N Boolean

Hello,

Im trying to program warshalls algorithum in java but an running into an error can someone please help.

Assume an N by N Boolean Matrix Representation for a transitive Boolean relation. Warshalls Algorithm generates the transitive closure.

import java.util.*;

public class Trendz {

public static void main (String args[]){

int i;

int j;

int k;

int N;

int Arr[];

for ( i = 0; i < N ; i++ ){

for ( j = 0 ; j < N ; i++){

if( Arr[j,i] == true){ // <<<< error happening here!

for ( k = 0; k < N ; k++){

Arr[j,k] == A[j,k];

}

}

}

}

}

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!