计算机科学Hamitonian 路径问题Hamitonian 路径问题HAMPATH={⟨G,s,t⟩∣G is a directed graph with a Hamiltonian path from s to t}H A M P A T H=\{\langle G, s, t\rangle \mid G\text{ is a directed graph with a Hamiltonian path from s to t}\}HAMPATH={⟨G,s,t⟩∣G is a directed graph with a Hamiltonian path from s to t} 它属于 NP 完全复杂度类，但它的补集不是。