第11讲(拓扑排序、最短路径).pptVIP

* §2 Topological Sort 〖Example〗 Courses needed for a computer science degree at a hypothetical university How shall we convert this list into a graph? 1/17 §2 Topological Sort ? AOV Network ::= digraph G in which V( G ) represents activities ( e.g. the courses ) and E( G ) represents precedence relations ( e.g. means that C1 is a prerequisite course of C3 ). C1 C3 ? i is a predecessor of j ::= there is a path from i to j i is an immediate predecessor of j ::= i, j ? E( G ) Then j is called a successor ( immediate successor ) of i ? Partial order ::= a precedence relation which is both transitive ( i ? k, k ? j ? i ? j ) and irreflexive ( i ? i is impossible ). Feasible AOV network must be a DAG (directed acyclic graph). Note: If the precedence relation is reflexive, then there must be an i such that i is a predecessor of i. That is, i must be done before i is started. Therefore if a project is feasible, it must be irreflexive. 2/17 §2 Topological Sort 【Definition】A topological order is a linear ordering of the vertices of a graph such that, for any two vertices, i, j, if i is a predecessor of j in the network then i precedes j in the linear ordering. 〖Example〗 One possible suggestion on course schedule for a computer science degree could be: 3/17 §2 Topological Sort Note: The topological orders may not be unique for a network. For example, there are several ways (topological orders) to meet the degree requirements in computer science. Goal Test an AOV for feasibility, and generate a topological order if possible. void Topsort( Graph G ) { int Counter; Vertex V, W; for ( Counter = 0; Counter NumVertex; Counter ++ ) { V = FindNewVertexOfDegreeZero( ); if ( V == NotAVertex ) { Error ( “Graph has a cycle” ); break; } TopNum[V] = Counter; /*or output V */ for ( each W adjacent to V ) Indegree[ W ] – – ; } } /* O( |V| ) */ ? T = O( |V|2 ) 4/17 Exercise: p.337 9.