期中测验时间本五上午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 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) Definition 17: A directed graph is strongly connected if there is a path from a to b and from b to a whenever a and b are vertices in the graph. A directed graph is connected directed graph if there is a path from a to b or b to a whenever a and b are vertices in the graph. A directed graph is weakly connected if there is a path between every pair vertices in the underlying undirected graph. (a)strongly connected (b)connected directed (c)weakly connected strongly connected components: G1,G2,…,Gω V ={v1,v2,v3,v4,v5,v6,v7, v8} V1={v1,v7,v8}, V2={v2,v3,v5,v6}, V3={v4}, strongly connected components : G(V1),G(V2),G(V3) 5.2.4 Bipartite graph Definition18: A simple graph is called bipartite if its vertex set V can be partioned into two disjoint sets V1 and V2 such that every edge in the graph connects a vertex in V1 and a vertex in V2. (so that no edge in G connects either two vertices in V1 or two vertices in V2).The symbol Km,n denotes a complete bipartite graph: V1 has m vertices and contains all edges joining vertices in V2, and V2 has n vertices and contains all edges joining vertices in V1. K3,3 , K2,3。 The graph is not bipartite Theorem 5.5:A graph is bipartite iff it does not contain any odd simple circuit. Proof:(1)Let G be bipartite , we prove it does not con