reader = new BufferedReader(new InputStreamReader(new FileInputStream(file), "UTF-8"));
            String tempStr = null;
            int staId = 0;//站点编号，唯一
            int time = 0;
            while ((tempStr = reader.readLine()) != null) {// 判断是否读到文件末尾
                if (time == 0) {// 如果读取的是第一条数据则初始化站点列表对象
                    time++;
                    line_stations = new LinkedList<>();
                }
                String[] message = tempStr.split("\\s+");// 分割站点信息
                lines.add(message[2]);// 读地铁线路
                if (message[3].equals("1")) {// 读取开通的地铁站
                    // 读取同一条线路的站点，读完则更新map并重新创建新线路的站点列表
                    if (!allStations.isEmpty()
                            && !((Station) ((LinkedList) allStations).getLast()).getLine().equals(message[2])) {
                        map.put(((Station) ((LinkedList) allStations).getLast()).getLine(), line_stations);
                        line_stations = new LinkedList<>();
                    }
                    Station station = new Station(staId++, message[1], message[2], message[4].equals("1"));
                    allStations.add(station);
                    line_stations.add(station);
                }
            }

            reader.close();

具体实现见Github

/* 属性 */

private Queue visited = null;// 已访问站点

int[] distance = null;;// 路径长度

private Map<String, List<Station>> line_stations = null;

static String nowLine = null;// 当前地铁线

static String[] nextLine = null;// 当前节点的下一换乘地铁线

static HashMap path = null;// 路径

static List<Station> list = null;

// 路径HashMap path;
path = new HashMap();
for (int i = 0; i < list.size(); i++)
    path.put(i, "");

// 初始化路径长度数组distance
for (int i = 0; i < list.size(); i++) {
    path.put(i, path.get(i) + "" + list.get(v).getStaName());
    if (i == v)
       distance[i] = 0;
    // 连通站点
    else if (weight[v][i] != -1) {
       distance[i] = weight[v][i];
       // 获取当前站点所属的地铁线
       nowLine = list.get(v).getLine();
       StringBuffer sbf = new StringBuffer();
       for (Station s : line_stations.get(nowLine)) {
           sbf.append(s.getStaName());
       }
       // 起点站和下一站点是否属于同一地铁线
       if (sbf.indexOf(list.get(i).getStaName()) != -1) {
          path.put(i, path.get(i) + "\n\t-->" + list.get(i).getStaName());
          nextLine[i] = nowLine;
       } else {
          path.put(i, path.get(i) + "\n-->换乘" + list.get(i).getLine() + "\n\t-->" + list.get(i).getStaName());
          nextLine[i] = list.get(i).getLine();
       }
    }
    // 不连通
    else
        distance[i] = Integer.MAX_VALUE;
}
visited.add(v);

//迭代寻找最优线路
while (visited.size() < list.size()) {
    int k = getIndex(visited, distance);// 获取未访问点中距离源点最近的点
    visited.add(k);
    if (k != -1) {

        for (int j = 0; j < list.size(); j++) {
            if (weight[k][j] != -1)// 判断k点能够直接到达的点
            {
                // 通过遍历各点，比较是否有比当前更短的路径，有的话，则更新distance，并更新path。
                if (distance[j] > distance[k] + weight[k][j]) {
                    distance[j] = distance[k] + weight[k][j];

                    nowLine = nextLine[k];
                    StringBuffer sbf = new StringBuffer();
                    for (Station s : line_stations.get(nowLine)) {
                        sbf.append(s.getStaName());
                    }
                    //判断到下一站点是否需要换乘
                    if (sbf.indexOf(list.get(j).getStaName()) != -1) {
                        path.put(j, path.get(k) + "\n\t-->" + list.get(j).getStaName());
                        nextLine[j] = nowLine;
                    } else {
                        StringBuffer tmpSbf = new StringBuffer();

                        for (String str : line_stations.keySet()) {
                            tmpSbf = new StringBuffer();
                            for (Station s : line_stations.get(str)) {
                                tmpSbf.append(s.getStaName());
                            }
                            if (tmpSbf.indexOf(list.get(j).getStaName()) != -1
                                    && tmpSbf.indexOf(list.get(k).getStaName()) != -1) {
                                path.put(j,
                                        path.get(k) + "\n-->换乘" + str + "\n\t-->" + list.get(j).getStaName());
                                nextLine[j] = str;
                            }
                        }
                    }
                }
            }
        }
    }
}