Depth of a vertex

Материал из WikiGrapp
Перейти к:навигация, поиск

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

The depth of a vertex v in a directed acyclic graph G is the length of the longest path in G from an input vertex to v, and the depth of G is the maximum depth of any of its vertices.

The depth of a vertex v in a rooted tree is its distance from the root, i.e. the number of edges in the path from the root to v.