By connecting every element of the set A with its equivalents,
we obtain the graphinterpretation of the partition, where the elements
of different classes of equivalence belong to mutually disconnected
parts (i.e. there is no path from one to another). Elements having no equivalents are
singular: each of them makes its own equivalence class.
