POJ2485(最小生成树)

POJ2485(最小生成树)

Highways

Description

The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the traffic is difficult in Flatopia. The Flatopian government is aware of this problem. They’re planning to build some highways so that it will be possible to drive between any pair of towns without leaving the highway system.

Flatopian towns are numbered from 1 to N. Each highway connects exactly two towns. All highways follow straight lines. All highways can be used in both directions. Highways can freely cross each other, but a driver can only switch between highways at a town that is located at the end of both highways.

The Flatopian government wants to minimize the length of the longest highway to be built. However, they want to guarantee that every town is highway-reachable from every other town.

Input

The first line of input is an integer T, which tells how many test cases followed.
The first line of each case is an integer N (3 <= N <= 500), which is the number of villages. Then come N lines, the i-th of which contains N integers, and the j-th of these N integers is the distance (the distance should be an integer within [1, 65536]) between village i and village j. There is an empty line after each test case.

Output

For each test case, you should output a line contains an integer, which is the length of the longest road to be built such that all the villages are connected, and this value is minimum.

Sample Input

1

3
0 990 692
990 0 179
692 179 0

Sample Output

692

题意

​ 城镇的编号从1到N。每条公路正好连接两个城镇。所有的公路都走直线。所有公路都可以双向通行。高速公路可以自由交叉，但驾驶员只能在位于两条高速公路末端的城镇的高速公路之间切换。弗拉托邦政府希望缩短最长高速公路的建设长度。然而，他们想保证每个城镇都是可以从其他城镇到达的高速公路。

思路

​ 输入的是一个邻接矩阵的图，求最小生成图里(n-1)条边最长的那一条边的长度是多少。

代码

import java.util.Scanner;
public class Highways {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int m = sc.nextInt();
    for (int i = 0; i < m; i++) {
      int n = sc.nextInt();
      int[][] graph = new int[n][n];
      for (int j = 0; j < n; j++) {
        for (int k = 0; k < n; k++) {
          graph[j][k] = sc.nextInt();
        }
      }
      int result = prim(graph, 0);
      System.out.println(result);
    }
  }

  public static int prim(int[][] graph, int startPoint) {
    int result = 0;

    int[] lowcost = new int[graph.length];
    int[] closest = new int[graph.length];
    int minDis = Integer.MAX_VALUE;

    for (int i = 0; i < lowcost.length; i++) {//lowcost和closest的初始值
      lowcost[i] = graph[startPoint][i];
      closest[i] = startPoint;
    }

    for (int i = 0; i < lowcost.length - 1; i++) {//除了startPoint之外的n-1个点
      minDis = Integer.MAX_VALUE;
      int index = startPoint;
      for (int j = 0; j < lowcost.length; j++) {
        if (lowcost[j] != 0 && lowcost[j] < minDis) {
          minDis = lowcost[j];
          index = j;
        }
      }
      if (result < minDis) {
        result = minDis;
      }
      lowcost[index] = 0;
      for (int j = 0; j < lowcost.length; j++) {//更新lowcost和closest
        if (graph[index][j] != 0 && graph[index][j] < lowcost[j]) {
          lowcost[j] = graph[index][j];
          closest[j] = index;
        }
      }
    }
    return result;
  }
}