Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public static int kaukaisimmat(int n, int[] mista, int[] minne) {
- long[][] d = new long[n + 1][n + 1];
- for (int i = 0; i < n + 1; i++)
- for (int e = 0; e < n + 1; e++)
- d[i][e] = -1;
- for (int i = 0; i < n + 1; i++)
- d[i][i] = 0;
- for (int i = 0; i < mista.length; i++) {
- d[mista[i]][minne[i]] = 1;
- d[minne[i]][mista[i]] = 1;
- }
- for (int v = 0; v < n + 1; v++)
- for (int i = 0; i < n + 1; i++)
- for (int j = 0; j < n + 1; j++)
- if (i != j)
- d[i][j] = Math.max(d[i][j], d[i][v] + d[v][j]);
- // tulostetaan matriisi
- for (int i = 0; i < d.length; i++) {
- for (int j = 0; j < d[1].length; j++) {
- System.out.print(d[i][j] + " ");
- }
- System.out.println("");
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement