Abstract
This paper characterizes connected components of both directed and undirected graphs as atomic fixpoints. As algebraic structure for our investigations we combine complete Boolean algebras with the well-known theory of Kleene Algebra with domain. Using diamond operators as an algebraic generalization of relational image and preimage we show how connected components can be modeled as atomic fixpoints of functions operating on tests and prove some advanced theorems concerning connected components.