数据结构与程序设计王丽苹32graphs拓扑排序.pptxVIP

Chapter 12GRAPHSTopological SortShortest PathMinimal Spanning T 牛牛文库文档分享Topological order(拓扑排序)Let G be a directed graph with no cycles. A topological order for G is a sequential listing of all the vertices in G such that, for all vertices v,w € G, if there is an edge from v to w, then v precedes w in the sequential listing.P580 Figure 12.7 牛牛文库文档分享Example: Topological order(拓扑排序)C0 高等数学，C1 程序设计语言，C2 离散数学， C3 数据结构，C4 算法语言，C5 编译技术，C6 操作系统， C7 概率论，C8 计算机原理 牛牛文库文档分享12.4.2 Depth-first AlgorithmStart by finding a vertex that has no successors and place it last in the order.By recursive, After placed all the successors of a vertex into the topological order, then place the vertex itself in position before any of its 牛牛文库文档分享 牛牛文库文档分享Digraph Class, Topological Sorttypedef int Vertex;template int graph_sizeclass Digraph {public: Digraph( ); void read( ); void write( ); // methods to do a topological sort void depth_sort(ListVertex topological_order); void breadth_sort(ListVertex topological_order);private: int count; List Vertex neighbors[graph_size]; void recursive_depth_sort(Vertex v, bool visited[], ListVertex topological_order);}; 牛牛文库文档分享Depth-First Algorithm p581template int graph_size void Digraphgraph_size ::depth_sort(ListVertex topological_order)/* Post: The vertices of the Digraph are placed into List topological_order with adepth-first traversal of those vertices that do not belong to a cycle.Uses: Methods of class List, and function recursive_depth_sort to perform depth-first traversal. */{ bool visited[graph_size]; Vertex v; for (v = 0; v count; v++) visited[v] = false; topological_order.clear( ); for (v = 0; v count; v++) if (!visited[v]) // Add v and its successors into topological order. recursive_depth_sort(v, visited, topological_order);} 牛牛文库文档分享Depth-First Algorithm p581template int graph_size void Digraphgraph_size ::recursive_depth_sort(Vertex v, bool *visited, ListVertex topological_order)/* Pre: Vertex v of the Digraph does not belong to the par