关于邻接表的建立与输出

Question

 #include<stdio.h>
#include<malloc.h>

#define max 10000
int edge[1000000][2]={0};
typedef struct _enode
{
    //int dis; 
    int vex;
    struct _enode* nextedge;
}enode;

typedef struct _vnode
{
    int vex;
    enode* firstedge;
}vnode;

typedef struct _pic
{
    int vex_num;
    int edge_num;
    vnode node[max];
}pic;



void find_insert(enode* edge,enode* temp)
{
    enode* p;
    p=edge;
    while(p->nextedge!=NULL)
        p=p->nextedge;
    p->nextedge=temp;
}

pic* create_pic()
{
    int i=0,c1,c2;
    enode* node_temp;
    pic* picture;
    picture=(pic*)malloc(sizeof(pic));
    picture->edge_num=5;
    picture->vex_num=3;

    for(i=1;i<=picture->vex_num;i++)   //you are sb。I just say to you 
    {
        picture->node[i].vex=i;
        picture->node[i].firstedge=NULL;
        c1=edge[i][0];
        c2=edge[i][1];
        node_temp=(enode*)malloc(sizeof(struct _enode));
        node_temp->vex=c2;

        if(picture->node[c1].firstedge==NULL)
        {
            picture->node[c1].firstedge=node_temp;
        }
        else
        {
            find_insert(picture->node[c1].firstedge,node_temp);
        }
    }

    return picture; 
}

int main(void)
{
    int i=0;
    pic* picture;
    for(i=1;i<=5;i++)
    {
        scanf("%d",&edge[i][0]);
        scanf("%d",&edge[i][1]);
    }
    picture=create_pic();

    for(i=1;i<=picture->vex_num;i++)
    {
        enode* p;
        p=(enode*)malloc(sizeof(enode));
        if(picture->node[i].firstedge==NULL)
            printf("error");
        else
        {
            p=picture->node[i].firstedge;
            printf("%d ",picture->node[i].vex);
            while(p!=NULL)
            {
                printf("%d ",p->vex);
                p=p->nextedge;
            }   
        }
        printf("\n");
    }

}

一个邻接表的建立与输出的程序，求大神看看为啥输入5个边的信息没有反应

Answer 1

调试下，picture->vex_num，是多少，是不是循环没有执行或死循环。