Graph temp = g;
    int counter = 0;
    while (counter <= sizeof(g->adj)){
        while (g->adj[counter] != NULL){
                temp->adj[counter] = g->adj[counter];
                g->adj[counter] = g->adj[counter]->next;
                free(temp->adj[counter]);

                }
        counter++;
        }

    free(g->adj);
    free(g);