软件设计8.pptVIP

Care and diligence bring luck． 细心勤奋，幸福之本。 Great works are performed not by strength but by perseverance． 成大事不是靠力量大小，而是靠坚忍不拔。 There are two kinds of persons,one is frigaround; the other is living a meaningful life;in the view of the former,life is like a sleep on an tenderwarm doss,which gives him satisfaction;whereas in the point of the latter,life means establishing great achievements from which the person enjoys his blessedness. 世界上有两种人，一种人，虚度年华；另一种人，过着有意义的生活。在第一种人眼里，生活就是一场睡眠，如果这场睡眠在他看来，是睡在既柔和又温暖的床铺上，那他便十分心满意足；在第二种人眼里，可以说，生活就是建立丰功伟绩……人就在这个功绩中享到自己的幸福。 －－别林斯基 Graph Definition: a kind of nonlinear data stru, widely used in fields such as artificial intelligence, engineering, mathematics, physics, etc. Binary group description: ??????? G=(V，E) V:finite non-empty set of vertexes;V(G) E:finite set of lines(margins)connected two vertexes. E(G) may be empty set with nodes without margins. Graph Digraph: A graph with directed edges from tail to head. arcvi，vjis different fromvj，vi. Digraph description G1=(V,E) V(G1)={v1，v2，v3} E(G1)={v1，v2，v2，v1，v2，v3}????? Undigraph: A graph with undirected edges from tail to head. Arc (vi，vj ) is same as(vj，vi). Digraph description G1=(V,E) V(G1)={v1，v2，v3} E(G1)={(v1，v2 ) ，(v2，v3),(v3，v1 )} Graph Note: (1)The relationship between vertex pair : (x,y) is different from x,y; (2) no permission self-cycle in diagram; (3) no repetition of edges between two vertexes, such diagram is called multi-edge diagram. Graph The relationship between vertex n and edge e: (1)if G is an undigraph, then: 0≤e≤n(n-1)/2an undiagraph with exactly n(n-1)/2 edges is an undirected complete graph. (2)if G is an digraph,then: 0≤e≤n(n-1) an diagraph with exactly n(n-1) edges is an directed complete graph. ??? 　 Complete graph has the most edges,any pair of vertexes has an edge. ??? 　 Degree of vertex: (1)degree of vertex in undigraph: D(v)-----the number of edges associative to the no