public static int mst(int[][] nabomatrise){
		int start = 0;
		ArrayList<int[]> edgeList = findEdges(nabomatrise[start], start);
		ArrayList<Integer> noderSett = new ArrayList<Integer>();
		int max = Integer.MIN_VALUE;
		noderSett.add(start);
		while (noderSett.size() < nabomatrise.length) {
			int[] currentEdge = new int[] {-1, INF};
			for (int[] edge : edgeList) {
				if (edge[1] < currentEdge[1] && !noderSett.contains(edge[0])) {
					currentEdge = edge;
				}
			}
			max = Math.max(max, currentEdge[1]);
			int node = currentEdge[0];
			noderSett.add(node);
			edgeList.addAll(findEdges(nabomatrise[node], node));
		}
		return max;
	}