public void init() {

        for (int i = 0; i < TEST_SIZE; i++) {
            graph[i] = new NonDirectedGraph<Integer>();
        }

        Scanner scanner = new Scanner(getClass().getResourceAsStream("/kargerMinCut.txt"));

        while (scanner.hasNextLine()) {
            String line = scanner.nextLine();
            String[] split = line.split("\t");

            for (int i = 1; i < split.length; i++) {
                Vertex<Integer> source = new Vertex<Integer>(Integer.valueOf(split[0]));
                Vertex<Integer> dest = new Vertex<Integer>(Integer.valueOf(split[i]));
                for (int j = 0; j < TEST_SIZE; j++) {
                    graph[j].addVertex(source);
                    graph[j].addVertex(dest);

                    if (!graph[j].isEdge(source, dest)) {
                        if (i % 2 == 0) {
                            graph[j].addEdge(source, dest);
                        } else {
                            graph[j].addEdge(dest, source);
                        }

                    }
                }
            }
        }
        scanner.close();
    }