Java数据结构---------数论
代码的实现:
static int m = 999;
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int[][] num = new int[n][n];
//假设初始的情况
for (int i = 0; i < n; i++) {
for (int i1 = 0; i1 < n; i1++) {
num[i][i1] = m;
if (i == i1) {
num[i][i1] = 0;
}
}
}
//放入点到点之间的代价
int count = 0;
while (true) {
count++;
int a = scanner.nextInt();
int b = scanner.nextInt();
int c = scanner.nextInt();
num[a][b] = c;
if (count == n - 1) {
break;
}
}
/ 走过的路径 ///
String[][] strings=new String[n][n];
for (int i = 0; i < n; i++) {
for (int i1 = 0; i1 < n; i1++) {
strings[i][i1]="";
}
}
/同一个代码逻辑
boolean flag=true;
while(flag) {
for (int i = 0; i < n; i++) {
for (int i1 = 0; i1 < n; i1++) {
//原路返回的两个点的代价
if (num[i][i1] > num[i1][i]) {
strings[i][i1]=i+"->"+i1;
num[i][i1] = num[i1][i];
}
//实现相邻的两个点
for (int i2 = 0; i2 < n; i2++) {
//一次
if (num[i][i1] > num[i2][i1] + num[i][i2]) {
num[i][i1] = num[i2][i1] + num[i][i2];
strings[i][i1]+=i+"->"+i2+"->"+i1;
}else {
strings[i][i1]+=i+"->"+i1;
}
}
实现相邻的两个点
}
}
//结束条件
int countnum1=0;
for (int i = 0; i < n; i++) {
int countnum=0;
countnum1++;
for (int i1 = 0; i1 < n; i1++) {
if(num[i][i1]==m){
break;
}
countnum++;
}
if(countnum==n&&countnum1==n){
flag=false;
}
}
//结束条件
}
/同一个代码逻辑
//遍历走路的代价
for (int i = 0; i < n; i++) {
for (int i1 = 0; i1 < n; i1++) {
System.out.printf("%d\t",num[i][i1]);
}
System.out.println();
}
//遍历走路的路径
for (int i = 0; i < n; i++) {
for (int i1 = 0; i1 < n; i1++) {
System.out.print(strings[i][i1]+" ");
}
System.out.println();
}
}
运行后的结果: