Computing connected components of graphs

Authors

  • Soghra Lazemi university of kashan
  • Hossein Ebrahimpour-Komleh university of kashan

DOI:

https://doi.org/10.14419/ijamr.v3i4.3189

Published:

2014-10-25

Abstract

In this article, we represent an algorithm for finding connected elements in an undirected graph with n vertices based on adjacency matrix.

Keywords: Connected Components, Adjacency Matrix, and Undirected Graph.

References

J. Bondy, U. Murty, Graph Theory with Applications, MacMillan, New York, (1976).

R. Diestel, Graph Theory, 4th Electronic Edition, (2010).

R. Miller, L. Boxer, Algorithms Sequential and Parallel—a Unified Approach, Second Edition, Charles River Media, (2005).

D. Jungnickel, Graphs, networks and algorithms, Berlin, Second Auflage, (2005).

S. Steven, the Algorithm Design Manual, (2011).

View Full Article: