Implementation of depth traversal adjacency matrix of figure 6-5

6-5 Depth traversal of Graphs - Adjacency matrix implementation

This problem requires the realization of depth first traversal of adjacency matrix storage graph .

Function interface definition ：

void DFS(MGraph G,Vertex v);
among MGraph Is a graph stored in adjacency matrix , The definition is as follows ：

#define MaxVertexNum 10 / Define the maximum number of vertices /
typedef int Vertex;/* Use vertex subscript to represent vertex , Is an integer */
typedef struct{
int arcs[MaxVertexNum][MaxVertexNum]; / Adjacency matrix /
int vexnum,arcnum; / Number of vertices in the graph vexnum And the number of sides arcnum/
}MGraph; / Types of graphs represented by adjacency matrix /
Sample referee test procedure ：

#include"stdio.h"
#include"stdlib.h"
typedef enum{FALSE,TRUE} Boolean;
#define MaxVertexNum 10 / Define the maximum number of vertices /
typedef int Vertex;/* Use vertex subscript to represent vertex , Is an integer /
typedef struct{
int arcs[MaxVertexNum][MaxVertexNum]; / Adjacency matrix /
int vexnum,arcnum; / Number of vertices in the graph vexnum And the number of sides arcnum/
}MGraph; / Types of graphs represented by adjacency matrix /
Boolean visited[MaxVertexNum]; / Access token for vertex */
void CreatMGraph(MGraph G);/ Create a diagram and add Visited Initialize to false; The referee realizes , Details don't show /
void DFS(MGraph G,Vertex v);
int main()
{
Vertex v;
MGraph G;
CreatMGraph(&G);
scanf(“%d”, &v);
printf(“DFS from %d:”,v);
DFS(G,v);
return 0;
}
/ Your code will be embedded here */
For a given graph ：

sample input ：
The first line gives the number of vertices of the graph n And the number of sides e, And then e That's ok , Each row gives two vertex numbers for an edge , The last line gives the starting vertex number of the traversal .

7 9
0 2
0 3
0 4
1 3
1 5
2 3
2 5
4 5
5 6
5
sample output ：
DFS from 5: 5 1 3 0 2 4 6

Code ：

void DFS(MGraph G,Vertex v)
{
    
    visited[v] = 1;
    printf(" %d",v);
    for(int i = 0; i < G.vexnum ; i++)
        if(G.arcs[v][i] ==1 && !visited[i])
           DFS(G, i);
    return;
}

202206201636 One