private static void findRoute () {

        while (mPoints.size() > 0) {

            double dist[] = new double[mPoints.size()];

            for (int j = 0; j < mPoints.size(); j ++) {
                if (j != 0) {
                    dist[j] = getWeight(mPoints.get(0), mPoints.get(j));
                }
            }

            double min = findMinValue(dist);
            int iMin = 0;

            for (int m = 0; m < dist.length; m ++) {
                if (dist[m] == min) iMin = m;
            }

            fPoints.add(mPoints.get(iMin));
            mPoints.remove(0);

            if (mPoints.size() > 0) {

                for (int i = 1; i < mPoints.size(); i ++) {
                    if (mPoints.get(i) != null) {
                        LatLng latLng = mPoints.remove(i);
                        mPoints.add(i - 1, latLng);
                    }
                }

            }

        }

    }