source: branches/RoutePlanning/HeuristicLab.Problems.RoutePlanning/3.3/Graph/Vertex.cs @ 8434

namespace HeuristicLab.Problems.RoutePlanning.Graph {
  public class Vertex {
    private long id;
    public long Id {
      get { return id; }
      set { id = value; }
    }

    private double longitude;
    public double Logitude {
      get { return longitude; }
      set { longitude = value; }
    }

    private double latitude;
    public double Latitude {
      get { return latitude; }
      set { latitude = value; }
    }

    public Vertex(long id) {
      this.id = id;
    }

    public static bool operator ==(Vertex v1, Vertex v2) {
      if ((object)v1 == null) {
        if ((object)v2 == null) {
          return true;
        }
        return false;
      }
      if ((object)v1 == null && (object)v2 != null) {
        return false;
      }
      return v1.Equals(v2);
    }

    public static bool operator !=(Vertex v1, Vertex v2) {
      return !(v1 == v2);
    }

    public override bool Equals(object obj) {
      if (obj is Vertex) {
        Vertex v = (obj as Vertex);
        return this.Equals(v);
      }
      return false;
    }

    public override int GetHashCode() {
      return id.GetHashCode() ^ latitude.GetHashCode() ^ longitude.GetHashCode();
    }

    public override string ToString() {
      return string.Format("{0}", id);
    }


  }
}