namespace HeuristicLab.Problems.RoutePlanning.Graph {
  // represent linked vertices
  public class Route {
    private long headVertexId;
    public long HeadVertexId {
      get { return headVertexId; }
    }

    private float weight;
    public float Weight {
      get { return weight; }
    }

    private Route tail;
    public Route Tail {
      get { return tail; }
    }

    public Route(long vertexId) {
      this.headVertexId = vertexId;
      this.weight = 0;
      this.tail = null;
    }

    public Route(long vertexId, float weight, Route tail) {
      this.headVertexId = vertexId;
      this.weight = weight;
      this.tail = tail;
    }

  }
}