package jimDij;

/*****
 * An Edge object for graph problems.  <p>
 * 
 * Thee methods here are all get-ers and set-ers 
 * for the internal data.
 * 
 * @author Jim Mahoney (mahoney@marlboro.edu)
 * @version 0.1 Nov 25 2002
 ***/

public class Edge {

    /**
     * fromNode --->  (distance) ----> toNode 
     **/
    private int   distance;
    private Node  fromNode;
    private Node  toNode;

    public Node getFromNode(){
        return fromNode;
    }
    public void setFromNode(Node n){
        fromNode = n;
    }
    public Node getToNode(){
        return toNode;
    }
    public void setToNode(Node n){
        toNode = n;
    }
     public int getDistance(){
        return distance;
    }
    public void setDistance(int d){
        distance = d;
    }


}