kante.java

自己上学编的基于Dijkstra的最短路径&最大流量java源码

/**
 * The class Kante is used to represents edges 
 */
public class Kante {
	
	//start node
	private String preNode;

	//end node
    private String nachnode;

    //distance in kilometer
    private int lang;
    
    //Max. speed in kilometer/hour
    private int speed;
    
    //time in minute
    private float runTime;

    public Kante(String preNode, String nachnode, int lang, int speed) {
        this.preNode = preNode;
        this.nachnode = nachnode;
        this.lang = lang;
        this.speed = speed;
        this.runTime = (float)lang * 60 / (float)(speed);
    }

    public String getPreNode() {
        return preNode;
    }

    public void setPreNode(String preNode) {
        this.preNode = preNode;
    }

    public String getNachNode() {
        return nachnode;
    }

    public void setNachNode(String nachnode) {
        this.nachnode = nachnode;
    }

    public int getLang() {
        return lang;
    }

    public void setLang(int lang) {
        this.lang = lang;
    }
    
    public int getSpeed() {
        return speed;
    }

    public void setSpeed(int speed) {
        this.speed = speed;
    }
    
    public float getRunTime() {
    	return runTime; 
    }
    
    public void setRunTime(float runTime) {
    	this.runTime = runTime; 
    }

}