text: //==================================================================
  // File			: twoOpt.h
  // Author		: rsagalyn
  // Date			: Aug 25, 2013
  // Description		: Perform optimizations on graph
  //==================================================================
  #ifndef MYGRAPH_H
  #define MYGRAPH_H
  
  #include <vector>
  #include <stack>
  #include <iostream>
  //#include <cstdlib>
  //#include <cmath>
  
  using namespace std;
  
  // Non-looping version of two-opt optimization heuristic
  double twoOpt(double **graph, vector<int> &path, double &pathLength, int n);
  
  // 2-Opt helper function: swap two nodes
  int is_path_shorter(double **graph, int v1, int v2, int v3, int v4, double &total_distance);
  
  void reverse(vector<int> &path, int start, int end, int n);
  
  
  
  
  // move this to tsp class
  double get_path_length(double **graph, vector<int> &path, int size);
  
  
  #endif
  