dijkstrainterface.java

这是一个将Dijkstra算法的时间复杂度从O(n*n) 优化为O(nlogn)的方法

// DijkstraInterface.java
// CNA, S2, 2008
// v 0.1, 02 July 2008 - Nick Falkner

public interface DijkstraInterface {

    // This allows the programmer to change the source node for calculation
    // without forcing them to expose their data structure.

    public NetworkNode getSourceNode();

    // initialiseNetwork opens up and parses the config file, then puts it
    // into the Network storage representation format.
    // Regardless of how you implement this, the network must be ready to 
    // go when we push the 'computeShortestPaths' button.

    public void initialiseNetwork(String filename);

    // This is the important part - we have to nominate a source node
    // from which all paths are calculated, or the algorithm won't work.

    public void computeShortestPaths(NetworkNode sourceNode);

    // This should display all of the final network paths and weights
    // in the format given in the assignment.

    public void displayFinalNetwork();

}