- 2023-12-21交个崔鹏题 OJ实践1-C /图的广度搜索/C++
#include<iostream>#include<malloc.h>#include<queue>usingnamespacestd;#defineMAX10typedefintE;typedefstructNode{ intnextVex; structNode*next;}*node;structHeadNode{ Eelement; structNode*next;};typedefstruct
- 2023-12-21交个崔鹏题 OJ实践1-B
#include<iostream>#include<malloc.h>#include<string.h>usingnamespacestd;#defineMAX10#defineINF0;typedefintE;typedefstructGraphMartix{ intvex,edge; intmarixWeight[MAX][MAX]; Edata[MAX];}*Graph;GraphCreate(intv)
- 2023-12-21交个崔鹏题 OJ实践1-A
#include<iostream>#include<malloc.h>usingnamespacestd;typedefintE;typedefstructNode{ Eelement; structNode*next;}*node;voidinitList(nodend){nd->next=NULL;}voiddeleteDup(nodend){if(nd==NULL)return;
- 2023-12-21交个崔鹏题 6-A /c++
#include<iostream>#defineMAX10#include<malloc.h>#include<string.h>#include<stdlib.h>usingnamespacestd;typedefcharE;typedefstructEdge{ Estart; Eend; intweight;}*Edges;typedefstructGraphMatrix{ intvex,edge