Java Dijkstra邻接表

我遇到了一个将Dijkstras算法的伪代码转换为实际代码的问题。我得到了一个邻接列表，例如“位置-相邻位置-到位置的距离”，例如一个节点：AAA AAC 180 AAD 242 AAH 40。 我的任务是读取按所述邻接列表组织的文件，并计算从一个节点到另一个节点的最短路径。 这是Dijkstra伪代码：

    void dijkstra( Vertex s )
    {
        for each Vertex v
        {
          v.dist = INFINITY;
          v.known = false;
        }
      s.dist = 0;
        while( there is an unknown distance vertex )
         {
          Vertex v = smallest unknown distance vertex;
          v.known = true;

         for each Vertex w adjacent to v
          if( !w.known )
           {
           DistType cvw = cost of edge from v to w;
           if( v.dist + cvw < w.dist )
             {
    // Update w
           decrease( w.dist to v.dist + cvw );
           w.path = v;
             }
            }
           }
    }

void dijkstra（顶点s）
{
对于每个顶点v
{
v、 距离=无穷大；
v、 已知=错误；
}
s、 dist=0；
while（存在未知距离顶点）
{
顶点v=最小未知距离顶点；
v、 已知=真实；
对于与v相邻的每个顶点w
如果（！w.known）
{
DistType cvw=从v到w的边缘成本；
如果（v.dist+cvw

“对于与v相邻的每个顶点w”这条线，我遇到的问题最多 这是我的非工作代码：

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.LinkedList;
import java.util.List;
import java.util.ListIterator;

public class Dijkstra {

    public static boolean isInteger(String s) {
        return isInteger(s, 10);
    }

    public static boolean isInteger(String s, int radix) {
        if (s.isEmpty())
            return false;
        for (int i = 0; i < s.length(); i++) {
            if (i == 0 && s.charAt(i) == '-') {
                if (s.length() == 1)
                    return false;
                else
                    continue;
            }
            if (Character.digit(s.charAt(i), radix) < 0)
                return false;
        }
        return true;
    }

    public static void dijkstra(Vertex[] a, Vertex s, int lineCount) {
        int i = 0;
        while (i < (lineCount)) // each Vertex v
        {
            a[i].dist = Integer.MAX_VALUE;
            a[i].known = false;
            i++;
        }

        s.dist = 0;
        int min = Integer.MAX_VALUE; //

        while (!(a[0].known == true && a[1].known == true && a[2].known == true && a[3].known == true
                && a[4].known == true && a[5].known == true && a[6].known == true && a[7].known == true
                && a[8].known == true && a[9].known == true && a[10].known == true && a[11].known == true
                && a[12].known == true)) {
            System.out.println("here");
            for (int b = 0; b < lineCount; b++) {

                if (a[b].dist < min && a[b].known == false) {
                    min = a[b].dist;
                }
            }
            int c = 0;
            while (c < lineCount) {

                if (a[c].dist == min && a[c].known == false) {
                    break;
                }
                c++;
            }
            System.out.println(min);

            a[c].known = true;
            int adjSize = a[c].adj.size();

            int current = 0;

            System.out.println(adjSize);

            while (current < adjSize - 1) {

                String currentAdjacent = (String) a[c].adj.get(current);
                int p = 0;

                while (p < lineCount) {
                    if (a[p].name.equals(currentAdjacent)) {

                        if (!a[p].known) {
                            String cvwString = (String) a[c].distance.get(current);
                            int cvw = Integer.parseInt(cvwString);
                            System.out.println(" This is cvw" + cvw);
                            System.out.println("Here2");

                            if (a[c].dist + cvw < a[p].dist) {
                                a[p].dist = a[c].dist + cvw;
                                a[p].path = a[c];
                            }
                        }
                    }
                    p++;
                }
                current++;
            }
        }
    }

    public static class Vertex {
        public List adj; // Adjacency list
        public List distance;
        public boolean known;
        public int dist; // DistType is probably int
        public Vertex path;
        public String name;

        // Other fields and methods as needed
    }

    public static void printPath(Vertex v) {
        if (v.path != null) {
            printPath(v.path);
            System.out.print(" to ");
        }
        System.out.print(v);
    }

    public static void main(String[] args) throws IOException {

        int lineCounter = 0;

        BufferedReader br = new BufferedReader(new FileReader("airport.txt"));
        try {
            StringBuilder sb = new StringBuilder();
            String line = br.readLine();

            while (line != null) {

                sb.append(line);
                sb.append(System.lineSeparator());
                line = br.readLine();

                lineCounter = lineCounter + 1;
            }

            Vertex[] arr = new Vertex[lineCounter];
            for (int i = 0; i < lineCounter; i++) {
                arr[i] = new Vertex();
                arr[i].adj = new LinkedList<String>();
                arr[i].distance = new LinkedList<Integer>();
            }
            ;

            //
            int arrayCounter = 0;
            String everything = sb.toString();
            String[] lines = everything.split("\\s*\\r?\\n\\s*");

            for (String line1 : lines) {
                arr[arrayCounter] = new Vertex();

                arr[arrayCounter].adj = new LinkedList<String>();
                arr[arrayCounter].distance = new LinkedList<Integer>();
                String[] result = line1.split("\\s+");

                for (int x = 0; x < result.length; x++) {
                    if (x == 0) {
                        arr[arrayCounter].name = result[0];
                        continue;
                    } else if (isInteger(result[x])) {
                        arr[arrayCounter].distance.add(result[x]);
                        continue;
                    } else {
                        arr[arrayCounter].adj.add(result[x]);
                        continue;
                    }
                }

                arrayCounter++;
            }

            for (int i = 0; i < 12; i++) {
                System.out.println(arr[i].name);
            }
            System.out.println(lineCounter);
            dijkstra(arr, arr[3], lineCounter - 1);
            printPath(arr[11]);

        } finally {
            br.close();
        }
    }
}

导入java.io.BufferedReader；
导入java.io.FileReader；
导入java.io.IOException；
导入java.util.LinkedList；
导入java.util.List；
导入java.util.ListIterator；
公共级迪杰斯特拉酒店{
公共静态布尔isInteger（字符串s）{
返回isInteger（s，10）；
}
公共静态布尔isInteger（字符串s，整数基数）{
如果（s.isEmpty（））
返回false；
对于（int i=0；i