| 34 | public static int n; |
| 35 | |
| 36 | public static double prim(double x) { |
| 37 | for (int i = 1; i <= n; i++) { |
| 38 | visit[i] = false; |
| 39 | value[i] = cost[1][i] - x * dist[1][i]; |
| 40 | } |
| 41 | visit[1] = true; |
| 42 | double sum = 0; |
| 43 | for (int i = 1; i <= n - 1; i++) { |
| 44 | double minDist = Double.MAX_VALUE; |
| 45 | int next = 0; |
| 46 | for (int j = 1; j <= n; j++) { |
| 47 | if (!visit[j] && value[j] < minDist) { |
| 48 | minDist = value[j]; |
| 49 | next = j; |
| 50 | } |
| 51 | } |
| 52 | sum += minDist; |
| 53 | visit[next] = true; |
| 54 | for (int j = 1; j <= n; j++) { |
| 55 | if (!visit[j] && value[j] > cost[next][j] - x * dist[next][j]) { |
| 56 | value[j] = cost[next][j] - x * dist[next][j]; |
| 57 | } |
| 58 | } |
| 59 | } |
| 60 | return sum; |
| 61 | } |
| 62 | |
| 63 | public static void main(String[] args) throws IOException { |
| 64 | BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); |