int main()
{
      int i, j;
      int v = 0;
      Queue *q = makeQueue();
      FILE *f = fopen("diamtest.txt", "r");
      if (f == NULL)
      {
            printf("FILE ERR\n");
            return 0;
      }
      else
      {
            fscanf(f, "%d %d", &vertices, &edge);
            for (i = 1; i <= vertices; i++)
            {
                  for (j = 1; j <= 2; j++)
                  {
                        fscanf(f, "%d", &array[i][j]);
                        printf("array[%d][%d] = %d\n", i, j, array[i][j]);
                  }
            }
      }
      v = 1;
      pushQueue(q, v);
      while (q->head != NULL)
      {
            v = frontQueue(q);
            popQueue(q);
            visitedarray[v] = v;
            if (v == vertices)
                  break;
            for (int i = 1; i <= 2; i++)
            {
                  if (array[v][i] != visitedarray[i])
                        pushQueue(q, array[v][i]);
            }
            if (array[v][i] != visitedarray[i])
                  pushQueue(q, array[v][i]);
      }
      for (i = 1; i <= 6; i++){
            printf("%d\n", visitedarray[i]);
      }
      return 0;
}