问无法释放分配的内存

EN

#include <stdio.h>
#include <stdlib.h>

#define maxNodes 4

typedef struct edge {
    int target;
    struct edge* next;
} edge;

typedef struct node {
    edge* start;
} node;

int isInvalidInput(int input) {
    if(input > 3 && input < 0) {
      puts("Invalid input");
      return 1;
    }
    return 0;
}

int recreateGraph(node* graph) {
  edge* roam;
  for(int index = 0; index < maxNodes; index++) {
    roam = graph[index].start;
    while(roam) {
      edge* aux = roam;
      roam = roam->next;
      free(aux);
      aux = NULL;
    }

  }
  return 0;
}

int deleteEdge(node* graph, int node, int target) {

  if(!graph[node].start) {
    return 1;
  }

  edge* roam = graph[node].start;
  if(roam->target == target) {
    edge* aux = roam;
    graph[node].start = roam->next;
    free(aux);
    return 0;
  }

  while(roam->next) {
    if(roam->target == target) {
      edge* aux = roam;
      roam = roam->next;
      free(aux);
      return 0;
    }
    roam = roam->next;
  }
  return 1;
}

int insertEdge(node* graph, int from, int to) {
    if(isInvalidInput(from) == 1 && isInvalidInput(to) == 1) return 1;
    if(!graph[from].start) {
        graph[from].start = (edge*) malloc(sizeof(edge));
        graph[from].start->target = to;
        return 1;
    }
    edge* roam = graph[from].start;
    while(roam->next) {
        roam = roam->next;
    }
    roam->next = (edge*) malloc(sizeof(edge));
    roam->next->target = to;
    return 0;
}

node* createGraph() {
    node* graph = (node*) malloc(sizeof(graph) * maxNodes);
    for(int index = 0; index < maxNodes; index++) {
        graph[index].start = (edge*) malloc(sizeof(edge));
        graph[index].start = NULL;
    }
    return graph;
}

int main()
{
    node* graph = createGraph();
    insertEdge(graph, 0, 2);
    insertEdge(graph, 0, 1);
    insertEdge(graph, 2, 1);

    //deleteEdge(graph, 0, 1);
    recreateGraph(graph);

    printf("%i ", graph[0].start->next);
    return 0;
}