English

Connectivity Algorithm

Data Structures and Algorithms 2015-07-27 v1

Abstract

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.

Keywords

Cite

@article{arxiv.1507.06677,
  title  = {Connectivity Algorithm},
  author = {Krishnendra Shekhawat},
  journal= {arXiv preprint arXiv:1507.06677},
  year   = {2015}
}
R2 v1 2026-06-22T10:17:31.339Z