## Quick Reference

*V*_{0} and *V** _{k}* if each pair (

*V*

*,*

_{i}*V*

*),*

_{i+1}*i*= 0,1…,

*k*-1 is an edge of the graph and, in the case of a directed graph, is suitably directed.

(*V** _{i}*,

*V*

*),*

_{i+1}*i*= 0,1…,

*k*-1

In typical applications, the existence of paths between vertices indicates physical connections between them or perhaps logical connections or dependencies. See also cycle.

**From:**
path
in
A Dictionary of Computing »

*Subjects:*
Computing.