This work focuses on connectivity in a dynamic graph. An undirected graph is defined finite and discrete time interval. Edges can appear disappear over time. The first objective of this to extend the notion connected component graphs new way. Persistent components are by their size, corresponding number vertices, length, consecutive steps they present on. second develop an algorithm computing l...