Dijkstra的算法Java，使用多源时的路径错误

Question

我从互联网 (here the original code) 找到了 Dijkstra 算法，我尝试使用多个源而不是多个目标。但是当我运行代码时，输​​出不正确，它只显示所有输出的第一个顶点。

import java.util.PriorityQueue;
import java.util.List;
import java.util.ArrayList;
import java.util.Collections;

class Vertex implements Comparable<Vertex> {

    public final String name;
    public Edge[] adjacencies;
    public double minDistance = Double.POSITIVE_INFINITY;
    public Vertex previous;
    public Vertex(String argName) { name = argName; }
    public String toString() { return name; }
    public int compareTo(Vertex other) {
        return Double.compare(minDistance, other.minDistance);
    }

}

class Edge {

    public final Vertex target;
    public final double weight;

    public Edge(Vertex argTarget, double argWeight) {
        target = argTarget;
        weight = argWeight;
    }

}

public class tes_dijkstra {

    public static void computePaths(Vertex source) {
        source.minDistance = 0.;
        PriorityQueue<Vertex> vertexQueue = new PriorityQueue<Vertex>();
        vertexQueue.add(source);

        while (!vertexQueue.isEmpty()) {
            Vertex u = vertexQueue.poll();
            // Visit each edge exiting u
            for (Edge e : u.adjacencies) {
                Vertex v = e.target;
                double weight = e.weight;
                double distanceThroughU = u.minDistance + weight;
                if (distanceThroughU < v.minDistance) {
                    vertexQueue.remove(v);
                    v.minDistance = distanceThroughU ;
                    v.previous = u;
                    vertexQueue.add(v);
                }
            }
        }
    }

    public static List<Vertex> getShortestPathTo(Vertex target) {
        List<Vertex> path = new ArrayList<Vertex>();
        for (Vertex vertex = target; vertex != null; vertex = vertex.previous)
            path.add(vertex);
        Collections.reverse(path);
        return path;
    }

    public static void main(String[] args) {
        Vertex v0 = new Vertex("Redvile");
        Vertex v1 = new Vertex("Blueville");
        Vertex v2 = new Vertex("Greenville");
        Vertex v3 = new Vertex("Orangeville");
        Vertex v4 = new Vertex("Purpleville");

        v0.adjacencies = new Edge[]{ new Edge(v1, 5),
                                     new Edge(v2, 10),
                                     new Edge(v3, 8) };
        v1.adjacencies = new Edge[]{ new Edge(v0, 5),
                                     new Edge(v2, 3),
                                     new Edge(v4, 7) };
        v2.adjacencies = new Edge[]{ new Edge(v0, 10),
                                     new Edge(v1, 3) };
        v3.adjacencies = new Edge[]{ new Edge(v0, 8),
                                     new Edge(v4, 2) };
        v4.adjacencies = new Edge[]{ new Edge(v1, 7),
                                 new Edge(v3, 2) };
        Vertex[] start = { v1, v2, v3, v4 };
        Vertex[] end ={v2};

        for (int i = 0; i < start.length; i++){
            for(int j = 0; j < end.length; j++){
                computePaths(start[i]);
                System.out.println("Distance to " + end[j] + ": " + end[j].minDistance);
                List<Vertex> path = getShortestPathTo(end[j]);
                System.out.println("Path: " + path);
            }
        }
    }
}

这就是输出的样子：

Distance to Greenville: 3.0
Path: [Blueville, Greenville]
Distance to Greenville: 0.0
Path: [Blueville, Greenville]
Distance to Greenville: 0.0
Path: [Blueville, Greenville]
Distance to Greenville: 0.0
Path: [Blueville, Greenville]

输出仅显示所有输出的 Vertex[] start (v1 = Blueville) 的第一个顶点。 我不知道哪里错了，路径是否存储在某个地方？我在java中有点新，我想为我的作业学习这个算法，所以请帮忙。谢谢

Answer 1

是的，顶点存储有关成本和构建路径的信息。问题不在于构建路径本身，而是minDistance 是与给定起始顶点的距离。你可以在Vertex类中实现一个方法reset

void reset () {
    this.minDistance = Double.POSITIVE_INFINITY;
}

此外，当您想要执行下一个 Dijkstra 算法时，您需要重置图的 所有 个顶点：

public static List<Vertex> getShortestPathTo(Vertex target) {
    List<Vertex> path = new ArrayList<Vertex>();
    for (Vertex vertex = target; vertex != null; vertex = vertex.previous)
        path.add(vertex);
    Collections.reverse(path);
    return path;
}

public static void main(String[] args) {
    Vertex v0 = new Vertex("Redvile");
    Vertex v1 = new Vertex("Blueville");
    Vertex v2 = new Vertex("Greenville");
    Vertex v3 = new Vertex("Orangeville");
    Vertex v4 = new Vertex("Purpleville");

    v0.adjacencies = new Edge[]{ new Edge(v1, 5),
                                 new Edge(v2, 10),
                                 new Edge(v3, 8) };
    v1.adjacencies = new Edge[]{ new Edge(v0, 5),
                                 new Edge(v2, 3),
                                 new Edge(v4, 7) };
    v2.adjacencies = new Edge[]{ new Edge(v0, 10),
                                 new Edge(v1, 3) };
    v3.adjacencies = new Edge[]{ new Edge(v0, 8),
                                 new Edge(v4, 2) };
    v4.adjacencies = new Edge[]{ new Edge(v1, 7),
                             new Edge(v3, 2) };
    Vertex[] start = { v1, v2, v3, v4 };
    Vertex[] end = {v2};
    Vertex[] all = {v0, v1, v2, v3, v4};

    for (int i = 0; i < start.length; i++){
        for(int j = 0; j < end.length; j++){
            computePaths(start[i]);
            System.out.println("Distance to " + end[j] + ": " + end[j].minDistance);
            List<Vertex> path = getShortestPathTo(end[j]);
            System.out.println("Path: " + path);
        }
        //a new start vertex: reset the graph
        for(Vertex v : all) {
            v.reset();
        }
    }
}