Paths Consider a flow graph G=(N,E).A sequence of k edges,k >0, (e_1,e_2,...,e_k),denotes a path of length k through the flow graph if the following sequence condition holds. > Given that np,ng,nr,and ns are nodes belonging to N,and O<i<k,if ei=(np,na)and ei+1=(nr,ns)then ng nr Complete path:a path from start to exit Subpath:a subsequence of a complete path 1111 Paths • Consider a flow graph G = (N, E). A sequence of k edges, k >0, (e_1,e_2,…,e_k), denotes a path of length k through the flow graph if the following sequence condition holds. ➢ Given that 𝑛𝑝, 𝑛𝑞, 𝑛𝑟 , and 𝑛𝑠 are nodes belonging to N, and 0<i<k, if 𝑒𝑖 = (𝑛𝑝, 𝑛𝑞) and 𝑒𝑖+1 = (𝑛𝑟 , 𝑛𝑠 ) then 𝑛𝑞 = 𝑛𝑟 ➢ Complete path: a path from start to exit ➢ Subpath: a subsequence of a complete path