Inheritance graph

Inheritance graph --- граф наследования.

An inheritance graph is a directed acyclic multigraph [math]\displaystyle{ H = (X,E) }[/math] with a least element denoted by [math]\displaystyle{ 0_{H} }[/math] and a greatest element denoted by [math]\displaystyle{ 1_{H} }[/math]. The transitive closure [math]\displaystyle{ H^{tc} }[/math] of [math]\displaystyle{ H }[/math] induces a partial order. In the context of object oriented languages, this order is called the inheritance relation.