Given a graph, a path is a sequence of distinct nodes (N_{1},N_{2},...,N_{k}) where each pair of consecutive nodes is connected by an edge, i.e., N_{1} is connected to N_{2}, N_{2} is connected to N_{3}, etc. In this example, the path is said to connect N_{1} to N_{k}.