void FindDups(Edge **G,int n)
{
   for (int i=0 ; i<(n/2) ; i++)
   {
      for (Edge *t=G[i] ; t ; t=t->Next)
      {
         for (Edge *tt = t->Next ; tt ; tt=tt->Next)
         {
            if (t->Vertex == tt->Vertex)
            {
               fprintf(stdout,"Duplicate Found %d to %d\n",i,t->Vertex);
            }
         }
      }
   }
}
