networklink.java

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

public class NetworkLink {
	 String fromNode;
     String toNode;
     double weight; 

    public NetworkLink(String from ,String to ,double wei) {
    	
    	this.fromNode = from;
    	this.toNode = to;
    	this.weight = wei;
    	
    }
    
    public String getFromNode() {
    	
    	return this.fromNode;
    	
    }
    
    public String getToNode() {
    	
    	return this.toNode;
    	
    }
    
    public double getWeight() {
    	
    	return this.weight;
    	
    }
    
    // Find the neighour v of w
    // @name w'name
    public boolean containsNode(String name) {
    	
    	if(fromNode.equals(name) || toNode.equals(name)) {
    		return true;
    	}
    	return false;
    }
    
    
    	
}