c语言无向图邻接表深度有限搜索

最近写了一遍无向图的深度优先搜索，用的是邻接表，我看网上还没有相应的博客，于是就发出来。

最近比较忙，我先把代码贴出来，再慢慢解释加内容。

说明：用的软件是vs2017，默认所有输入都是合法的

#include<stdio h="">#include<malloc h="">;#include<cstring>;#define MAXVEX 100typedef struct edgeNode {int mark;//边下标struct edgeNode *next;}EdgeNode,*Ep;typedef struct vextexNode {//图头边结点结构体char name;//存储当前节点名称edgeNode *firstEdgeNode;}VextexNode,VextexList[MAXVEX],*Vp;typedef struct {//图结构体VextexList vextexList;int numOfNodes, numOfVex;}GraphList,*Gp;int createVextexNode(VextexList &vexList, int numOfNode)//传入头结点表，和头节点数量{int i = 0;if (numOfNode > MAXVEX){printf("Vex overFlow");//点的数量超出return -1;}for (i = 0; i < numOfNode; i++)//存储点的名字建立数组{getchar();printf("\npls input No.%d Vex name", i + 1);scanf_s("%c", &vexList[i].name);printf("%c", vexList[i].name);vexList[i].firstEdgeNode = NULL;}for (i = 0; i < numOfNode; i++)//检查输入是否正常{printf("No.%d is %c", i + 1, vexList[i].name);}}void showGrap(GraphList grapList)//输出整个图{for (int i = 0; i < grapList.numOfNodes; i++){Ep p = grapList.vextexList[i].firstEdgeNode;if (p != NULL) {printf("\nNo.%d Node is name is %c,it has:", i + 1, grapList.vextexList[i].name);printf(" %c%c ", grapList.vextexList[i].name, grapList.vextexList[p->mark].name);while (p->next != NULL){p = p->next;printf(" %c%c ", grapList.vextexList[i].name, grapList.vextexList[p->mark].name);}}else{printf("\nNo.%d Node is name is %c,it doesn't have Vex", i + 1, grapList.vextexList[i].name);}}}int createEdge(GraphList &grapList, char name,char toVEX)//输入节点创建连接{/*Ep ep=(Ep)malloc(sizeof(edgeNode));Gp gp;*/int toVexOrder=-1;int fromVexOrder = -1;int orderTemp;int i = 0;for (; i < grapList.numOfNodes; i++){if (toVEX == grapList.vextexList[i].name)//将指向的边的名字存入toVex;{toVexOrder = i;}if (name == grapList.vextexList[i].name)//存储起始点和木标点{fromVexOrder = i;}}if (toVexOrder != -1 && fromVexOrder != -1)//在初始点和目标点分别创建节点{if (grapList.vextexList[fromVexOrder].firstEdgeNode == NULL){Vp p = &grapList.vextexList[fromVexOrder];p->firstEdgeNode = (Ep)malloc(sizeof(edgeNode));p->firstEdgeNode->mark = toVexOrder;p->firstEdgeNode->next = NULL;printf("\ncreate %c FirstEdgeNode", grapList.vextexList[fromVexOrder].name);}else{Ep p = grapList.vextexList[fromVexOrder].firstEdgeNode;while (p->next != NULL)p = p->next;p->next = (Ep)malloc(sizeof(edgeNode));p = p->next;p->mark = toVexOrder;p->next = NULL;printf("\ncreate %c Edge", grapList.vextexList[fromVexOrder].name);}if (grapList.vextexList[toVexOrder].firstEdgeNode == NULL){Vp p = &grapList.vextexList[toVexOrder];p->firstEdgeNode = (Ep)malloc(sizeof(edgeNode));p->firstEdgeNode->mark = fromVexOrder;p->firstEdgeNode->next = NULL;printf("\ncreate %c FirstEdgeNode", grapList.vextexList[toVexOrder].name);}else{Ep p = grapList.vextexList[toVexOrder].firstEdgeNode;while (p->next != NULL)p = p->next;p->next = (Ep)malloc(sizeof(edgeNode));p = p->next;p->mark = fromVexOrder;p->next = NULL;printf("\ncreate %c Edge", grapList.vextexList[toVexOrder].name);}}else{printf("Error:can't find Edge,plz try again.");}return 1;}int createConnect(GraphList &grapList, int numOfVex)//创建连接{for (int i = 0; i < numOfVex; i++){char ca[3];char from, to;printf("\nplz input fromVEX and toVex:");scanf_s("%s", &ca,sizeof(ca));from = ca[0];to = ca[1];getchar();//C语言这里真的是个坑，找出这个bug我花了半个小时，最后改用一种麻烦的方式，确保输入正确createEdge(grapList, from, to);printf("from %c to %c", from, to);}return 1;}void InitGraph(GraphList &g)//初始化一个无向图{int b;printf("请输入顶点的数量：");scanf_s("%d", &b);g.numOfNodes = b;createVextexNode(g.vextexList,g.numOfNodes);printf("请输入边的数量：");int a;scanf_s("%d", &a);getchar();g.numOfVex = a;createConnect(g, g.numOfVex);showGrap(g);}bool isInArray(char a, char *pa, int sum)//字符是否在字符串数组里{for (int i = 0; i < sum; i++){if (pa[i] == a)return true;}return false;}int DFS(GraphList &gp,Vp p,char *pa)//深度优先搜索{if (isInArray(p->name,pa,gp.numOfNodes))return 0;printf("%c", p->name);for (int i = 0; i < gp.numOfNodes; i++)//如果字符数组中没有这这个字符，即没有遍历它，就输出然后深度遍历它{if (pa[i] == ' ') {pa[i] = p->name;break;}}Ep q = p->firstEdgeNode;for (; q != NULL;){DFS(gp, &gp.vextexList[q->mark], pa);q = q->next;}}int main(){GraphList gp;InitGraph(gp);int b = gp.numOfNodes;char *pa=new char[b];for (int i = 0; i < b; i++){pa[i] = ' ';}printf("\nDFS output\n:");DFS(gp, &gp.vextexList[0], pa);return 0;}/*8 a b c d e f g h 9 ab ac bd be dh eh cf cg fg*/</cstring></malloc></stdio></cstring></malloc></stdio>