Developing Programming Tools to Handle Traveling Salesman Problem by the Three Object-Oriented Languages

Algorithm 2

Graph ADT.

    //nodes indexes start at 0 and go up to  graph dimenion  −  1

(1)   class Graph

(2)   {

(3)   public:

(4)     Graph(char    path);

(5)     ~Graph();

(6)     int D(int node1,int node2);

(7)     int D(int x1,int y1,int x2,int y2);

(8)     int Dimension();

(9)     double X(int node);

(10)  double Y(int node);

(11) };