FUH22860/Graph
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

adjacent matrix can be calculated

Browse Source
This commit is contained in:
FUH22860 2022-06-17 16:43:13 +02:00
parent b3a9cad35d
commit 0a11547e66
1 changed files with 23 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

34
src/model/Graph.java
View File

@ -7,9 +7,6 @@ import java.io.IOException;
import java.util.ArrayList; import java.util.ArrayList;
public class Graph { public class Graph {
// private static int[][] adjacent = { {0,1,0},
// {1,0,1},
// {0,1,0} };
private static int[][] adjacent = { {0,1,1,1,0}, private static int[][] adjacent = { {0,1,1,1,0},
{1,0,0,1,1}, {1,0,0,1,1},
@ -37,20 +34,35 @@ public class Graph {
} }
// public static int[][] calculateAdjacent2(int[][] adjacent) {
//
// int[][] adjacent2 = new int[adjacent.length][adjacent.length];
//
// for(int row = 0; row < adjacent.length; row++) {
// for(int col = 0; col < adjacent.length; col++) {
// adjacent2[row][col] = 0; // Initialize Array
// for(int pos = 0; pos < adjacent.length; pos++) { // Position in Array
// adjacent2[row][col] += adjacent[row][pos] * adjacent[pos][col]; // row * col
// }
// }
// }
//
// return adjacent2;
// }
public static int[][] calculateAdjacent2(int[][] adjacent) { public static int[][] calculateAdjacent2(int[][] adjacent) {
int[][] adjacent2 = new int[adjacent.length][adjacent.length]; int[][] adjacent3 = new int[adjacent.length][adjacent.length];
for(int row = 0; row < adjacent.length; row++) { for(int row = 0; row < adjacent.length; row++) {
for(int col = 0; col < adjacent.length; col++) { for(int col = 0; col < adjacent.length; col++) {
adjacent2[row][col] = 0; // Initialize Array for(int pos = 0; pos < adjacent.length; pos++) {
for(int pos = 0; pos < adjacent.length; pos++) { // Position in Array adjacent3[row][col] += adjacent[pos][col] * adjacent[row][pos];
adjacent2[row][col] += adjacent[row][pos] * adjacent[pos][col]; // row * col
} }
} }
} }
return adjacent2; return adjacent3;
} }
public static void getAdjacent2() { public static void getAdjacent2() {
@ -78,9 +90,8 @@ public class Graph {
for(int row = 0; row < adjacent.length; row++) { for(int row = 0; row < adjacent.length; row++) {
for(int col = 0; col < adjacent.length; col++) { for(int col = 0; col < adjacent.length; col++) {
adjacent2[row][col] = 0; // Initialize Array
for(int pos = 0; pos < adjacent.length; pos++) { for(int pos = 0; pos < adjacent.length; pos++) {
adjacent3[row][col] += adjacent2[row][pos] * adjacent[pos][col]; adjacent3[row][col] += adjacent2[pos][col] * adjacent[row][pos];
} }
} }
} }
@ -98,6 +109,7 @@ public class Graph {
for (int j = 0; j < adjacent.length; j++) { for (int j = 0; j < adjacent.length; j++) {
System.out.print(adjacent3[i][j] + ", "); System.out.print(adjacent3[i][j] + ", ");
} }
System.out.println("\n");
} }
} }
else else