深度优先搜索（邻接矩阵、邻接表）

/**
 * 深度优先搜索
 * 
 * ①算法思想
 *
 * ②算法设计
 */

#include <stdio.h>
#include <iostream>
#include <cstdio>
#include <malloc.h>
#include <cstdlib>
#define MaxSize 20
#define INF 999999



//深度优先搜索 - 邻接矩阵
struct MGraph{
    char vex[MaxSize];
    int Edge[MaxSize][MaxSize];
    int vexnum,arcnum;
};
void DFS(MGraph G,int v,int *visited){
    visited[v] = 1;
    printf("%c ",G.vex[v]);
    for (int i = 0; i < G.vexnum; ++i) {//遍历一下与v相邻的点，看谁没有被访问过，每个i的for循环是断断续续访问完的
        if(G.Edge[v][i] != 0 && !visited[i]){//递归，这个if判断其实就是出口
            DFS(G,i,visited);//以这个没有被访问的点再进行DFS
        }
    }
}

void DFSTraverse(MGraph G){//图不一定连通
    //或者：int visited[MaxSize];
    int *visited = (int*)malloc(sizeof(int) * (G.vexnum));//动态开数组更规范
    for (int i = 0; i < G.vexnum; ++i) {//初始化
        visited[i] = 0;
    }
    for (int i = 0; i < G.vexnum; ++i) {
        if(!visited[i]){//if(visited[i] != 0)
            DFS(G,i,visited);
        }
    }
}


//深度优先搜索 - 邻接表
struct ArcNode{
    int adjvex;
    struct ArcNode *next;
    int weight;
};
struct VNode{
    char value;
    struct ArcNode *first;
};
struct AdGraph{
    VNode vertices[MaxSize];
    int vexnum,arcnum;
};
void DFS(AdGraph G,int v,int *visited){
    visited[v] = 1;
    printf("%c ",G.vertices[v].value);
    ArcNode *p = G.vertices[v].first;
    while(p){//边链表是断断续续访问完的
        if(!visited[p -> adjvex]){
            DFS(G,p -> adjvex,visited);
        }
        p = p -> next;
    }
}

void DFSTraverse(AdGraph G){//图不一定连通
    //或者：int visited[MaxSize];
    int *visited = (int*)malloc(sizeof(int) * (G.vexnum));//动态开数组更规范
    for (int i = 0; i < G.vexnum; ++i) {//初始化
        visited[i] = 0;
    }
    for (int i = 0; i < G.vexnum; ++i) {
        if(!visited[i]){//if(visited[i] != 0)
            DFS(G,i,visited);
        }
    }
}