邻接表存储结构建立无向图

ata && i < ; i++)

;

if(i >=

return -1;

return i;

}

ata); irstarc = NULL;

getchar();

}

char v1, v2;

for(int k = 0; k < ; k++)

{

printf("输入第 %d 条边依附的顶点v1: ", k+1); scanf("%c", &v1);

getchar();

printf("输入第 %d 条边依附的顶点v2: ", k+1); scanf("%c", &v2);

getchar();

int i = LocateVex(G, v1);

int j = LocateVex(G, v2); irstarc;

[i].firstarc =s;

t->adjvex = i; irstarc;

[j].firstarc =t;

}

return OK;

}

Status PrintAdjList(ALGraph &G)

{

ArcNode *p;

printf("%4s%6s%12s\n", "编号", "顶点", "相邻边编号"); for(int i = 0; i < ; i++)

{

printf("%4d%6c", i, [i].data);

for(p = [i].firstarc; p; p = p->nextarc)

printf("%4d", p->adjvex);

printf("\n");

}

return OK;

}

int main()

{

ALGraph G;

CreateUDN(G);

rintAdjList(G);

return 0;

}