public class New_Hamilton
{
/* 
   CSC 320: Summer 2017.

   These first two routines are of type int and return
   0 if there is no Hamilton path/cycle and
   1 if there is a Hamilton path/cycle 
   It would be more common in Java to use a Boolean variable
   instead but I wanted the code to work the same way as the
   C code handed out so all students would be on a common footing.

   The new_hamilton_path routine can make a polynomial number
   of calls to hamilton_cycle. The syntax:
   int answer;
   answer= Hamilton.hamilton_cycle(G);

   The new_hamilton_cycle routine can make a polynomial number
   of calls to hamilton_path. The syntax:
   int answer;
   answer= Hamilton.hamilton_path(G);

   IMPORTANT NOTE:
   The adjacency matrix of the graph must be symmetric.
   If you want to add an edge (u, v) you should use the
   TWO statements:
  
   G[u][v]= 1;
   G[v][u]= 1;
  
*/

   public static int new_hamilton_path(Graph G)
   {
       int answer;

    /* Replace with your new code. */
       answer=1;

       return(answer);
   }

   public static int new_hamilton_cycle(Graph G)
   {
       int answer;

    /* Replace with your new code. */
       answer=1;

       return(1);
   }
}