Depth of a vertex

Depth of a vertex --- глубина вершины.

The depth of a vertex [math]\displaystyle{ v }[/math] in a directed acyclic graph [math]\displaystyle{ G }[/math] is the length of the longest path in [math]\displaystyle{ G }[/math] from an input vertex to [math]\displaystyle{ v }[/math], and the depth of [math]\displaystyle{ G }[/math] is the maximum depth of any of its vertices.

The depth of a vertex [math]\displaystyle{ v }[/math] in a rooted tree is its distance from the root, i.e. the number of edges in the path from the root to [math]\displaystyle{ v }[/math].