Algorithm that checks if a directed graph represented by an adjacency matrix is strongly connected( there is a path connecting all vertices) .. Algorithm preferably in fortran. The hint given is :*** To check if there is a path from vertex i to any other vertex of a graph, an auxiliary n-element array X can be used which initially contains a copy of row i from the adjacency matrix A, and to which iteratively are added rows of A indicated by nonzero elements of X. When no new elements are added to X, the iteration ends. All nonzero elements of X indicate those nodes to which there is a path from node i. To check strong connectivity, the procedure is repeated for all nodes i of the graph.**** but this does not make sense to me b/c of poor english