private void delivery() {


            for (days = 0; comps < k; days++) {
                for (int i = 0; i < n; i++) {
                    addEdges(days * n + i, (days + 1) * n + i, INF);
                }

                for (int i = 0; i < m; i++) {
                    addEdges(days * n + tunnels.get(i).first, (days + 1) * n + tunnels.get(i).second, 1);
                    addEdges(days * n + tunnels.get(i).second, (days + 1) * n + tunnels.get(i).first, 1);
                }


                t = (days + 1) * n + sink;
                comps += findMaxFlow();
            }
            System.out.println(days);
        }