来自「数据结构里的dfs算法」· 代码 · 共 41 行

#include <iostream.h>

const int nmax=100;

typedef struct
{
	int data[nmax+1];    
    int adjmat[nmax+1][nmax+1];   
    int n,e;             
}mat_graph;



void dfs (mat_graph *ga,int v); 
void main()
{
	mat_graph ga;
    ga.n=4;
	ga.e=4;
	ga.adjmat[1][2]=1;
	ga.adjmat[2][3]=1;
	ga.adjmat[3][1]=1;
	ga.adjmat[1][4]=1;
    dfs(&ga, 1);
}

void dfs (mat_graph *ga,int v) 
{
	int j;
	int n=4;
	cout<<v<<" "; 
	int visited[100];
	visited[v]=1;           
	for(j=1;j<=n;j++)
	{                    
		if (ga->adjmat[v][j]==1&&!visited[j])
			dfs(ga, j);
		cout<<j<<endl;
	}
		cout<<"dfs completed"<<endl;
}