u011058935的博客

《数据结构》实验报告模板3-5.doc //ÎļþÃû:algo8-1.cpp #include <stdio.h> #include <malloc.h> #include "graph.h" //------------------------------------- //--------²»´øȨͼµÄËã·¨----------------- //------------------------------------- void MatToList(MGraph g,ALGraph *&G) //½«ÁÚ½Ó¾ØÕógת»»³ÉÁÚ½Ó±íG { int i,j; ArcNode *p; G=(ALGraph *)malloc(sizeof(ALGraph)); for (i=0;i<g.n;i++) //¸øÁÚ½Ó±íÖÐËùÓÐÍ·½ÚµãµÄÖ¸ÕëÓòÖóõÖµ G->adjlist[i].firstarc=NULL; for (i=0;i<g.n;i++) //¼ì²éÁÚ½Ó¾ØÕóÖÐÿ¸öÔªËØ for (j=g.n-1;j>=0;j--) if (g.edges[i][j]!=0) //ÁÚ½Ó¾ØÕóµÄµ±Ç°ÔªËز»Îª0 { p=(ArcNode *)malloc(sizeof(ArcNode)); //´´½¨Ò»¸ö½Úµã*p p->adjvex=j; p->nextarc=G->adjlist[i].firstarc; //½«*pÁ´µ½Á´±íºó G->adjlist[i].firstarc=p; } G->n=g.n;G->e=g.e; }