The length of a graph path is the number of edges it contains. This is one less than the number of vertices from the beginning of the first edge to the end of the last edge, inclusive.
Specific types of path lengths known as the external path length and internal path length are defined for extended binary trees.
