华南理工大学数据结构与算法课件Chapter7 Graph.pptVIP

3)The issues of graph connectivity requires a deep understanding, and mastery of the spanning tree algorithm ①Clearly know the concept of the undirected graph spanning tree and minimum spanning tree, its generation algorithm and implementation process; ②It can seek a minimum spanning tree of the given network. 4)Have a deep understanding of the digraph and its application issues. Master the basic ideas, solution methods and steps of the topological sort and critical path. Emphasis and Difficulties. Focus on the concept, properties, storage (including the adjacent matrix and adjacent list)