第十四章 最短路径.pptVIP

NP-Completeness ? Recall: ? Euler circuit problem: Find a path that touches every edge exactly once. ? Hamilton cycle problem: Find a single cycle that contains every vertex. ? ? ? Single-source unweighted shortest-path problem ? Single-source unweighted longest-path problem ? ? ? No known algorithms that are guaranteed to run in polynomial time. NP完全问题：哈密尔顿回路问题、最长路径问题、装箱问题、背包问题、图的着色问题 * ? Easy vs. Hard The easiest: O( N ) – since we have to read inputs at least once. The hardest: – undecidable problems. The great mathematician David Hilbert at the 1900 International Congress of Mathematicians outlined 23 research problems to be investigated in the coming century. One of the problems is the question of Decidability — Could there exist, at least in principle, any definite method or process by which all mathematical questions could be decided? Kurt G?del proved in 1931 that not all true statements that evolve from an axiomatic system can be proven – we can never know everything nor prove everything we discover. This statement is a lie. * 【Example】Halting problem: Is it possible to have your C compiler detect all infinite loops? Answer: No. Proof: If there exists an infinite loop-checking program, then surely it could be used to check itself. Loop( P ) { /* 1 */ if ( P(P) loops ) print (YES); /* 2 */ else infinite_loop(); } What will happen to Loop( Loop ) ? ? Terminates /* 2 */ is true Loops ? Loops /* 1 */ is true Terminates * ? The Class NP TURING MACHINE Alan Mathison Turing was born on 23 June 1912 in a nursing home in Paddington, London. In four inadequate words Alan Turing appears now as the Founder of Computer Science. During the Second World War, Turing made an important contribution on penetrating the mechanical Enigma cipher used by Germany. In 1944, at the invasion of Normandy that Allied control of the Atlantic allowed, Alan Turing was almost uniquely in possession of three key ideas: (1) his own 1936 concept of the universal machin