import java.util.*;
/**

*/
public class StrongWeakDisjoint
{
private boolean[][] adjMatrixDirected;
private int numberOfNodes;
public static final boolean CONNECTED = true;
private final boolean HAS_PATH = true;

public StrongWeakDisjoint(int numberOfNodes, boolean[][] graph)
{
   this.numberOfNodes = numberOfNodes;
   this.adjMatrixDirected = new boolean[this.numberOfNodes][this.numberOfNodes];

   for (int row = 0; row < this.numberOfNodes; row++)
         for (int col = 0; col < this.numberOfNodes; col++)
            this.adjMatrixDirected[row][col] = graph[row][col];
}

private boolean[][] buildReachabilityMatrix()
{
   return buildReachabilityMatrix(this.adjMatrixDirected);
}

private boolean[][] buildReachabilityMatrix(boolean[][] matrix)
{
   System.out.println("\n--> Building Reachability Matrix:");
   boolean[][] reachabilityMatrix = new boolean[this.numberOfNodes][this.numberOfNodes];

   //TODO Lab14 #2.1
   for (int row = 0; row < this.numberOfNodes; row++)
         for (int col = 0; col < this.numberOfNodes; col++)
            reachabilityMatrix[row][col] = matrix[row][col];
   for (int row = 0; row < this.numberOfNodes; row++) {
         for (int col = 0; col < this.numberOfNodes; col++) {
            if (reachabilityMatrix[row][col]) {
               System.out.println("row,col = " + row + "," + col);
               for (int rowNeighbor = 0; rowNeighbor < this.numberOfNodes; rowNeighbor++) {
                     if (rowNeighbor == col)
                        continue;
                     if (reachabilityMatrix[rowNeighbor][row]) {
                        reachabilityMatrix[rowNeighbor][col] = true;
                        System.out.println(" rowNeighbor,col = " + rowNeighbor + "," + col);
                     }
               }
            }
         }
   }

   return reachabilityMatrix;
}

private boolean[][] buildReversedMatrix()
{
   return buildReversedMatrix(this.adjMatrixDirected);
}

private boolean[][] buildReversedMatrix(boolean[][] matrix)
{
   System.out.println("\n--> Building Reversed Matrix:");
   boolean[][] reversedMatrix = new boolean[this.numberOfNodes][this.numberOfNodes];

   //TODO Lab14 #2.6
   for (int row = 0; row < this.numberOfNodes; row++) {
         for (int col = 0; col < this.numberOfNodes; col++) {
            if (matrix[row][col])
               reversedMatrix[col][row] = true;
         }
   }

   return reversedMatrix;
}

public boolean isGraphStronglyConnected(boolean[][] reachabilityMatrix)
{
   boolean result = true;

   // TODO Lab14 #2.2
   for (int row = 0; row < this.numberOfNodes; row++) {
         for (int col = 0; col < this.numberOfNodes; col++) {
            if (row == col)
               continue;
            if (reachabilityMatrix[row][col] == false)
               result = false;
         }
   }

   return result;
}

private boolean isUndirectedGraphConnected(boolean[][] graphUndirected)
{
   // utilizes breath-first-traversal algorithm
   Queue<Integer> bftQueue = new ArrayDeque<>();
   boolean[] visited = new boolean[this.numberOfNodes];

   // TODO Lab14 #2.4
   // must utilize breath-first-traversal algorithm
   bftQueue.add(0);
   while (!bftQueue.isEmpty()) {
         int row = bftQueue.remove();
         visited[row] = true;
         for (int col = 0; col < this.numberOfNodes; col++) {
            if (graphUndirected[row][col] && visited[col] == false)
               bftQueue.add(col);
         }
   }

   for (int vertex = 0; vertex < this.numberOfNodes; vertex++) {
         if (visited[vertex] == false)
            return false

Write a program that asks the user for a file name (or path). You...