最短路径问题 java

import java.util.Scanner;  

public class Shortway{
    int[][] e=new int[7][7];
    int[][] a={{0,0,0},{1,2,1},{2,4,2},{3,2,2},{4,5,3},{3,6,1},{1,3,3}};
    int inf=99999;
    int[] book=new int[7];
    int[] con=new int[7];
    public static void main(String args[]){
        Shortway s=new Shortway();
        s.go();
    }
    public void go(){
        scannin();
        int u;
        
        for(int i=1;i<=6;i++){
            book[i]=1;
        }
        for(int i=1;i<=6;i++){
                con[i]=e[1][i];
        }
        for(int i=1;i<=6;i++){
            System.out.print(con[i]);
        }
        for(int n=1;n<=5;n++){
            int j=1;
            int temp=inf;
            for(int i=1;i<=6;i++){
                if(book[i]!=0&&con[i]<temp){
                    temp=con[i];
                    j=i;
                }
            }
            u=j;
            System.out.println(u);
            book[u]=0;
            for(int i=1;i<=6;i++){
                if(book[i]!=0&&con[i]>con[u]+e[u][i]){
                    con[i]=con[u]+e[u][i];
                }
            }
        }
        
        for(int i=1;i<=6;i++){
            System.out.println(con[i]);
        }
    }
    public void scannin(){
        /* for(int i=1;i<=6;i++){
            for(int j=1;j<=3;j++){
                Scanner scanner = new Scanner(System.in);  
                a[i][j]=scanner.nextInt();
            }
        } */
        for(int i=1;i<=6;i++){
            e[a[i][0]][a[i][1]]=a[i][2];
        }
        for(int i=1;i<=6;i++){
            for(int j=1;j<=6;j++){
                if (i==j){
                    e[i][j]=0;
                }else if(e[i][j]==0){
                    e[i][j]=inf;
                }
            }
        }
        
    }
}