期中测验时间本周五上午940教师TA答疑时间周三晚上6.pptVIP

期中测验时间：本周五上午9：40 教师TA答疑时间:周三晚上6：00—8：30 地点：软件楼315房间， 教师TA：李弋老师 开卷考试 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-1 are all distinct. (e1,e2,e7,e1,e2,e9)is