Update GraphUtil::findCorrespondenceByNearestNeighbor()

- For the case of radial network which has more than 6 degrees, the
computation time explodes if we tests the whole permutation. Instead, I
restrict the maximum iteration number to 1000, and it seems be working
correctly for the radial network.