Given a graph, a path is a sequence of distinct nodes (N_1,N2,...,Nk) where each pair of consecutive nodes is connected by an edge, i.e., N1 is connected to N2, N2 is connected to N3, etc. In this example, the path is said to connect N1 to Nk.
Given a graph, a path is a sequence of distinct nodes (N_1,N2,...,Nk) where each pair of consecutive nodes is connected by an edge, i.e., N1 is connected to N2, N2 is connected to N3, etc. In this example, the path is said to connect N1 to Nk.