Danh sách kề - Đồ thị

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

typedef struct Node
{
    int point;
    struct Node *next;
}Node;

Node *Init()
{
    Node *temp;
    temp=(Node *)malloc(sizeof(Node));
    temp->point=0; temp->next=NULL;
    return temp;
}

int main()
{
    int n, point;
    printf("Nhap so luong dinh: "); scanf("%d",&n);
    Node *p[n];
    int i;
    for (i=0;i<n;i++)
        p[i]=Init();
    printf("Nhap cac dinh la ke voi cac dinh, nhap ngoai khoang (%d - %d) se coi nhu da het dinh ke.\n",1,n);
    for (i=0;i<n;i++)
    {
        Node *temp=p[i];
        printf("Dinh ke vs dinh %d: ",i+1);
        for (;;)
        {
            scanf("%d",&point);
            if (point>n || point<1 || point==i+1)
                break;
            Node *temp2=Init();
            temp->next=temp2;
            temp2->point=point;
            temp=temp2;
        }
    }
    printf("Danh sach cac dinh ke la: \n");
    for (i=0;i<n;i++)
    {
        Node *temp=p[i];
        printf("Dinh ke vs dinh %d: ",i+1);
        while (temp->next!=NULL)
        {
            printf("%d ",temp->next->point);
            temp=temp->next;
        }
        printf("\n");
    }
    return 0;
}