shortest_path_java.txt

package Q1;
import java.math.*;
import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;
public class Summer_Q1 {
static int n;
private static Boolean [] visited = new Boolean[1147];  //判断某结点是否被访问过
static int [][] G = new int[1147][];           //原图
static int [][] arrays = new int[3628801][];   //用来存放全排列
static int [] pointArray = new int[1146];      //存放深度优先遍历访问过的结点
static int [][] newG = new int[1000][];        //存放新的简化图
static int count = 0;
static int midPath = 0;                //中间结点的最短路径
static int Vbegin = 617,Vend = 393;    //起始点和终点
static int MAX = 9999;                 //最大值
static int N = MAX;
static int[] array = {82 ,75 ,510 ,351,  227, 549,8, 129};   //测试数组,必经点
static int point_num = array.length;                  //必经过的点的数目
static int point_count = 0;
    //List<String> 
static String [][] S = new String [1200][];    //存放图
//剪枝,深度优先遍历图，只保留遍历到的结点
    public static void DFSTraverse(int[][] Graph,int n, int i) { //n为矩阵的阶，i为根节点   
     int j;

visited[i] = true;
pointArray[point_count++] = i;
for(j = 0; j < n; j++) {  
if(Graph[i][j] != N 
&& visited[j] == false) {
DFSTraverse(Graph,n,j);
}
}
    }
public static void main(String [] args){
     int bus_stop = 0;   //统计车站总数
     String name = "C:\\Users\\13673\\Documents\\Tencent Files\\1848820180\\FileRecv\\adj_Graph.txt";
     try {
File file = new File(name);
InputStreamReader input = new InputStreamReader(new FileInputStream(file));
BufferedReader bf = new BufferedReader(input);
// 按行读取字符串
String str;
while ((str = bf.readLine()) != null) {
S[bus_stop] = str.split(" ");
bus_stop++;
}
bf.close();
input.close();
} catch (IOException e) {
e.printStackTrace();
}
     //将字符型数组转变为整型
     n = bus_stop;
     int k = 0;