In this work, for the given adjacency matrix of a graph, we present an algorithm which checks the connectivity of a graph and computes all of its connected components. Also, it is mathematically proved that the algorithm presents all the desired results.
Research
