public static int mst(int[][] nabomatrise){
		int currentNode = 0;
		int counter = 0;
		int len = nabomatrise.length;
		int max = Integer.MIN_VALUE;

		int[] noderSett = new int[len];
		noderSett[counter] = currentNode;

		while (counter < len - 1) {
			int nextNode = -1;
			int nextWeight = Integer.MAX_VALUE;

			for (int i = 0; i < counter + 1; i++) {
				for (int j = 0; j < len; j++) {
					if (! settNode(j, noderSett) && nabomatrise[noderSett[i]][j] < nextWeight) {
						nextNode = j;
						nextWeight = nabomatrise[noderSett[i]][j];
					}
				}
			}
			noderSett[counter++] = nextNode;
			max = Math.max(max, nextWeight);
		}
		return max;
	}