...000000 10000000 0 0.07 second 10000 10000 10000 0 48 seconds Many NP-complete problems turn out to be easy for random inputs (see[9],[10]).Hamilton path problem is solvable in linear average time (see=-=[8]-=-).But the algorithm in [8] is a random algorithm. My algorithm is a fixed algorithm that fits all graphs, and is proved theoretically. When randomly producing the un-directed graphs, I try to make the...

...e can make my job much easier than other choices. By a lot of comparing, contrasting and analysing, I choose the Hamilton path(cycle) as my study object. Reasons:(1) Hamilton path is a strong NPC(see =-=[3]-=-). Usually a strong NPC is harder than un-strong one, but as it is strong, I can try to get a polynomial time algorithm for it in any way,the result is always valid;(2) I use “divide” and “conquer” me...

...n time different inputs 100 100000000 100000000 0 0.0014 second 1000 10000000 10000000 0 0.07 second 10000 10000 10000 0 48 seconds Many NP-complete problems turn out to be easy for random inputs (see=-=[9]-=-,[10]).Hamilton path problem is solvable in linear average time (see[8]).But the algorithm in [8] is a random algorithm. My algorithm is a fixed algorithm that fits all graphs, and is proved theoretic...