Depth of a vertex
Depth of a vertex --- глубина вершины.
The depth of a vertex in a directed acyclic graph is the length of the longest path in from an input vertex to , and the depth of is the maximum depth of any of its vertices.
The depth of a vertex in a rooted tree is its distance from the root, i.e. the number of edges in the path from the root to .