Path --- путь.
1. Given a digraph , a path is a sequence of vertices such that for ; its length is . The path is simple if all its vertices are pairwise distinct. A path is a cycle if and , and a simple cycle if in addition are pairwise distinct.
2. Given a hypergraph , a path from a vertex to a vertex is a sequence of edges , , such that and , if for ; furthermore, we say that this path passes through a subset of , if is a subset of for some .