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
e10 e (el,e2,e7,el, e2, e7)is not a e 9 circuit )音g2 (el, e2, e7, e6, e12)is a c circuit e e e7 circuit:(a, b, c e4 (el,e2, e7)is a simple a) d e5 &(e1, e2, e7, e1, e2, e9)is not a path oo(e1, e2, e7, e6, e9)is a path from a to e oo(e1, e2, e9)is a path from a to e, is a simple path oo(a, b, c e
❖ (e1,e2,e7,e1,e2,e9)is not a path ❖ (e1,e2,e7,e6,e9)is a path from a to e ❖ (e1,e2,e9)is a path from a to e, is a simple path. ❖ (a,b,c,e) (e1,e2,e7,e1,e2,e7)is not a circuit (e1,e2,e7,e6,e12) is a circuit (e1,e2,e7) is a simple circuit. (a,b,c,a)