Description: This procedure introduced in the state of connectivity compression methods of dynamic programming can be very fast in time to solve the Hamiltonian circuit board on the count of the number. Time complexity O (n* m* 3 ^ n) far below the search.
To Search:
File list (Check if you may need any files):
小胖邮递员.pas
Download