Dynamic Connectivity Problem

Problem specification: The input is a sequence of pairs of integers, where each integer represents an object of some type and we are to interpret the pair p q as meaning “p is connected to q.” We assume that “is connected to” is an   equivalence relation, which means that it is

■  Reflexive  : p is connected to p.

■  Symmetric  : If p is connected to q, then q is connected to p.

■  Transitive : If p is connected to q and q is connected to r, then p is connected to r.

Example :(Edit-----)

Application of Dynamic Connectivity Problem:

·         Digital image processing

·         Networking( Computer, Social Networking )

·         Variable naming in different programming languages( FORTAN)

·         Elementary mathematics set

·         Computer circuit design 

Reference 

            1) Algorithms by RS & KW