数据结构与算法 国家级双语教学示范课程配套教材 作者 彭军 向毅 Chap8 graph.pptVIP

homework P524 1-9 11-14 In a directed graph, the flow along the arcs between two vertices can follow only the indicated direction. In an undirected graph, the flow between two vertices can go in either direction. * Final point: Tree and graph A tree is a graph in which each vertex has only one predecessor A graph is not a tree Spanning tree * adds a disjoint--that is, an unconnected--vertex to the graph * Like any other delete algorithm, the first thing we have to do to delete a vertex is to find it. Once we have found it, however, we also need to make sure that it is disjoint; that is, we