You are viewing an old version of this page. View the current version.
Compare with Current
View Page History
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.