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

destination is a pointer to a graphVertex. Processed is used only for traversals. It indicates that the data in a vertex are waiting to be processed or have already been processed during the current traversal. * The graph data are stored in the vertex node. These data pertain only to the vertex. Later we will see a structure that requires that we store the data about an arc. * 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 need to ensure that there are no arcs leaving or entering the vertex. If there are, we reject the deletion. * * An airline might use a graph to represent the routes between cities that it serves. The edge’s weight could represent the miles between the two cities or the price of the flight. * If the weights in the network are unique, then there will be only one minimum spanning tree. If there are duplicate weights, then there may be one or more minimum spanning trees. * in a network in which there is a path between any two vertices--the edges for the minimum spanning tree are chosen so that the following properties exist: * Each vertex node needs a Boolean flag indicating that the vertex has been inserted into the spanning tree. In addition, each arc needs an in-tree Boolean. * Positive infinity * * * * 在线教务辅导网： 更多课程配套课件资源请访问在线教务辅导网 馋死 PPT研究院 POWERPOINT ACADEMY 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 i