BJFUOJ-284

最新推荐文章于 2024-07-25 11:18:29 发布

魔女新之助

最新推荐文章于 2024-07-25 11:18:29 发布

阅读量354

点赞数 11

分类专栏： BJFUOJ 文章标签：深度优先算法

本文链接：https://blog.csdn.net/smyyyyffs/article/details/136649902

版权

BJFUOJ 专栏收录该内容

83 篇文章 1 订阅

订阅专栏

基于深度优先搜索的两顶点路径存在与否的判断

#include<iostream>

using namespace std;
#define maxsize 100

typedef struct ArcNode {
	int val;
	ArcNode* next;
	ArcNode() :val(0), next(nullptr) {}
	ArcNode(int x) :val(x), next(nullptr) {}

}ArcNode;
typedef struct VexNode {
	char data;
	ArcNode* first;
	VexNode():data('0'),first(nullptr){}
	VexNode(char x):data(x),first(nullptr){}
}VexNode;
typedef struct {
	int VexNum; int ArcNum;
	VexNode vexs[maxsize];
}ALGraph;

int findindex(ALGraph G, char x);

void CreateGraph(ALGraph& G, int n, int m);

void dfs(ALGraph G,int start, int end, int* visited,int &flag);

void findPath(ALGraph G,char start,char end);
int main() {

	int n, m;
	while (cin >> n >> m && (n != 0 && m != 0)) {
		ALGraph G;
		CreateGraph(G, n, m);
		char s, d;
		cin >> s >> d;
		findPath(G, s, d);
	}

	return 0;
}
int findindex(ALGraph G, char x) {
	for (int i = 1; i <= G.VexNum; i++) {
		if (G.vexs[i].data == x) return i;
	}
	return 0;
}
void CreateGraph(ALGraph& G, int n, int m) {
	G.VexNum = n;
	G.ArcNum = m;
	for (int i = 1; i <= n; i++) { //s输入顶点
		char x;
		cin >> x;
		G.vexs[i].data = x;
	}
	for (int i = 1; i <= m; i++) { //输入边
		char a1, a2;
		cin >> a1 >> a2;
		
		int index1 = findindex(G, a1);
		int index2 = findindex(G, a2);
		ArcNode* p1 = new ArcNode(index1);
		ArcNode* p2 = new ArcNode(index2);
		p1->next = G.vexs[index2].first;
		G.vexs[index2].first = p1;

		p2->next = G.vexs[index1].first;
		G.vexs[index1].first = p2;
	}

}
//递归
void dfs(ALGraph G, int start, int end, int* visited,int &flag) {
	if (start == end) {
		flag = 1;
		return;
	}
	//从邻接表找
	ArcNode* p = G.vexs[start].first;
	while (p) {
		if (visited[p->val] == 0) {
			visited[p->val] = 1;
			dfs(G, p->val, end, visited, flag);
		}
		p = p->next;
	}
}
void findPath(ALGraph G, char start, char end) {
	int visited[30] = { 0 };
	int s = findindex(G,start);
	int e = findindex(G,end);
	visited[start] = 1;
	int flag = 0;
	dfs(G, s, e, visited,flag);
	if (flag == 1) {
		cout << "YES" << endl;
	}
	else {
		cout << "NO" << endl;
	}
}