|
|
back to threadReply to message- Messages should be written in English and correspond to the matter of the website.
- Messages should not contain offences and obscene words.
- Messages should not contain correct solutions.
Possible solution. You can have an array deg[i][j] = count of adjacent unvisited cells for cell (i;j). While doing DFS sort edges by non-decreasing deg[i+move. first] [j+move. second]. It calls an heuristic after some scientist whose name begins at W.
|
|
|