DFS算法

关于DFS算法的一些思考

```c
#include <iostream>
#include<stdio.h>
using namespace std;
int martrix[6][6] = { {0,1,1,0,0,0},{1,0,1,0,0,0},{1,1,0,1,0,0},{0,0,1,0,1,1},{0,0,0,1,0,0},{0,0,0,1,0,0} };
bool vis[10];
int road[6];
typedef struct pathnode
{
	int road[10];
}pathnode;
pathnode path[10];
int j = 0;
typedef struct roadnode
{
	int road[10];
	struct roadnode* next;
}roadnode,*ptrroadnode;
ptrroadnode ptr;

void dfs(int index)//从index开始访问,此dfs方法只是得到按照dfs深度优先搜索所产生的顶点顺序
{
	printf("%d ", index);
	vis[index] = 1;
	for (int i = 0; i < 6; i++)
	{
		if (vis[i] == false && martrix[index][i] == 1)
		{
			dfs(i);
		}
	}
}
void dfs1(int start_num, int index)//此dfs方法输出所有能够走完所有顶点的路径.用数组作为中间变量,仅输出，不保存路径
{
	vis[start_num] = true;
	road[index] = start_num;
	if (index == 6 - 1)
	{
		for (int i = 0; i < 6; i++)
		{
			if (i > 0)
				printf("->");
			printf("%d",road[i]);
		}
		printf("\n");
		return;
	}
	for (int i = 0; i < 6; i++)
	{
		if (martrix[start_num][i] != 0 && vis[i] == false)
		{
			dfs1(i, index + 1);
			vis[i] = false;
		}
	}
}

void dfs2(int start_num, int index)//此dfs方法输出所有能够走完所有顶点的路径.用数组保存路径且输出，j只能是全局变量，表示这是第j条结果路径,如果没有这样的路径
                                   //则输出一条错误的路径
{
	vis[start_num] = true;
	path[j].road[index] = start_num;;
	if (index == 6 - 1)
	{
		//printf("flag\n");
		for (int i = 0; i < 6; i++)
		{
			if (i > 0)
				printf("->");
			printf("%d", path[j].road[i]);
		}
		printf("\n");
		
		j++;
		/// 路径复制，因为需要回溯
		for (int i = 0; i < 6; i++)
		{
			path[j].road[i] = path[j - 1].road[i];
		}
		return;
	}
	for (int i = 0; i < 6; i++)
	{
		if (martrix[start_num][i] != 0 && vis[i] == false)
		{
			dfs2(i, index + 1);
			vis[i] = false;
		}
	}
}

void dfs3(int start_num, int index)//此dfs方法输出所有能够走完所有顶点的路径.用链表保存路径且输出，链表指针传的就是指针，这样的话，指针的值不发生改变，
                                   //函数中的ptr需要用全局变量，main函数中p指针就是头指针,需要路径的复制
{
	vis[start_num] = true;
	ptr->road[index] = start_num;
	if (index == 6 - 1)
	{
		ptrroadnode p;
		p = (ptrroadnode)malloc(1 * sizeof(roadnode));
		p->next = NULL;
		for (int i = 0; i < 6; i++)
		{
			p->road[i] = ptr->road[i];
		}
		//printf("改变前:ptr=%d\n", ptr);
		ptr->next = p;
		ptr = p;
		//printf("改变后：ptr=%d\n", ptr);

		return;
	}
	for (int i = 0; i < 6; i++)
	{
		if (martrix[start_num][i] != 0 && vis[i] == false)
		{
			dfs3(i, index + 1);
			vis[i] = false;
		}
	}
}

void dfs4(int start_num, int index,ptrroadnode& ptr)//此dfs方法输出所有能够走完所有顶点的路径.用链表保存路径且输出,链表指针传的是指针的引用，这样的话
                                                    //函数中的ptr可以改变，可以减少全局变量的使用，但是main函数中的p指针不是头指针需要在dfs前用sp=p，先将头
	                                                //指针保存下来,需要路径的复制
{
	vis[start_num] = true;
	ptr->road[index] = start_num;
	if (index == 6 - 1)
	{
		ptrroadnode p;
		p = (ptrroadnode)malloc(1 * sizeof(roadnode));
		p->next = NULL;
		for (int i = 0; i < 6; i++)
		{
			p->road[i] = ptr->road[i];
		}
		//printf("改变前:ptr=%d\n", ptr);
		ptr->next = p;
		ptr = p;
		//printf("改变后：ptr=%d\n", ptr);

		return;
	}
	for (int i = 0; i < 6; i++)
	{
		if (martrix[start_num][i] != 0 && vis[i] == false)
		{
			dfs4(i, index + 1,ptr);
			vis[i] = false;
		}
	}
}

void dfs5(int start_num, int index)//此dfs方法输出所有路径包括走到死胡同的.用数组保存路径且输出，j只能是全局变量，表示这是第j条结果路径
{
	vis[start_num] = true;
	path[j].road[index] = start_num;;
	int flag = 0;
	for (int i = 0; i < 6; i++)
	{
		if (martrix[start_num][i] != 0 && vis[i] == false)
		{
			flag = 1;
			dfs5(i, index + 1);
			vis[i] = false;
		}
	}
	if (!flag)
	{
		for (int i = index+1; i < 6; i++)
		{
			path[j].road[i] = 0;
		}
		j++;
		/// 路径复制，因为需要回溯
		for (int i = 0; i < 6; i++)
		{
			path[j].road[i] = path[j - 1].road[i];
		}
	}
}
int main() 
{

	ptrroadnode p;
	p = (ptrroadnode)malloc(1 * sizeof(roadnode));
	p->next = NULL;	
	ptrroadnode sp = p;
	//ptr = p;
	//printf("dfs前：p=%d\n", p);
	dfs5(0,0);
	for (int t = 0; t <= j; t++)
	{
		for (int i = 0; i < 6; i++)
		{
			if (i > 0)
			{
				printf("->");
			}
			printf("%d", path[t].road[i]);
		}
		printf("\n");
	}
	//printf("dfa=s后：p=%d\n", p);
	/*
	while (sp->next != NULL)
	{
		for (int i = 0; i < 6; i++)
		{
			if (i > 0)
				printf("->");
			printf("%d", sp->road[i]);
		}
		printf("\n");
		sp = sp->next;
	}
	*/

	printf("\n");
	return 0;
}