| commit | b2e6c1a3f984567393528d41a3eb9262d6024d64 | |
| author | Jochen Keil <jochen.keil@gmail.com> | |
| Tue, 29 Jun 2010 19:26:21 +0000 (29 21:26 +0200) | ||
| committer | Jochen Keil <jochen.keil@gmail.com> | |
| Tue, 29 Jun 2010 19:26:21 +0000 (29 21:26 +0200) | ||
| tree | 7960d42f8a5282f83eb71865748193d759261839 | treesnapshot (tar.gz zip) |
| parent | 9dd4ac32390ae85925b105dcf6b13f49eb653852 | commitdiff |
make computation of nearest neighbour list depth smarter
If it is set to zero then figure out a value depending on the number of
cities to visit. It it bigger then the number of cities to visit, set it
equal to number of cities.
If it is set to zero then figure out a value depending on the number of
cities to visit. It it bigger then the number of cities to visit, set it
equal to number of cities.
| aco/strategy/GraphStrategy.java | diffblobblamehistory |