Dynamic Connectivity Theaory

Given a set of N objects.
・Union command: connect two objects.
・Find/connected query: is there a path connecting the two objects?



Applications involve manipulating objects of all types.
・Pixels in a digital photo.
・Computers in a network.
・Friends in a social network.
・Transistors in a computer chip.
・Elements in a mathematical set.
・Variable names in Fortran program.
・Metallic sites in a composite system.

When programming, convenient to name objects 0 to N –1.
・Use integers as array index.
・Suppress details not relevant to union-find.


Comments