邻接表的存.docVIP

邻接表的存储 #includestdio.h #define n 4 void main() { int i,j; int sum=0; int v[4]; int G[n][n]={0,1,1,0,0,0,0,0,0,0,0,1,1,0,0,0}; for(i=0;in;i++) for(j=0;jn;j++) printf(%d,G[n][n]); scanf(请输入第i个顶点%d,i); for(j=0;jn;j++) sum+=G[i][j]; v[i]=sum; printf(%d,v[i]); } 单链表逆转 #includestdlib.h #includestdio.h typedef struct lnode { int data; struct lnode *next; } linklist; void nizhuan(linklist *p) { linklist *p,*p1,*p2,*p3; int temp; p1=p; if(!p-next)return; p2=p1-next; if(!p2-next) { temp=p1-data; p1-data=p2-data; p2-data=temp; return; } p3=p2-next; p1-next=NULL; while(p3-next) {