5.2.3 Connectivity in directed graphs .o Definition 16: Let n be a nonnegative integer and g be a directed graph. A path of length n from u to v in G is a sequence of edges ere2y-.en of G such that e=(vo=u, v1),e2=(v1v2 en=(vn1 vn=v), and no edge occurs more than once in the edge sequence. A path is called simple if no vertex appear more than once A circuit is a path that begins and ends with the same vertex. A circuit is simple if the vertices vo, V1,.Vn are all distinct.❖5.2.3 Connectivity in directed graphs ❖ Definition 16: Let n be a nonnegative integer and G be a directed graph. A path of length n from u to v in G is a sequence of edges e1 ,e2 ,…,en of G such that e1=(v0=u,v1 ), e2=(v1 ,v2 ), …, en=(vn-1 ,vn=v), and no edge occurs more than once in the edge sequence. A path is called simple if no vertex appear more than once. A circuit is a path that begins and ends with the same vertex. A circuit is simple if the vertices v0 ,v1 ,…,vn are all distinct