Topological Sort

最新推荐文章于 2021-01-24 18:03:25 发布

原创最新推荐文章于 2021-01-24 18:03:25 发布 · 615 阅读

0 ·

CC 4.0 BY-SA版权

算法--图、树专栏收录该内容

3 篇文章

订阅专栏

本文通过一个具体的穿衣顺序示例，介绍了如何使用深度优先搜索（DFS）算法来解决实际问题。该示例创建了一个节点类表示衣物，并用矢量表示衣物间的依赖关系，通过DFS遍历来找出正确的穿衣顺序。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include<iostream>
#include<vector>
#include<string>
using namespace std;
class Node
{
public:
	Node(string data)
	{
		this->data=data;
		begin=0;
		finish=0;
		color="white";
		p=NULL;
	}
	string data;
	int begin;
	int finish;
	string color;
	Node *p;
	vector<Node*> vecAdj;
};
int time=0;
void DFS(vector<Node*> vecQ,Node *u);
void main()
{
	Node *jacket=new Node("jacket");
	Node *undershorts=new Node("undershorts");
	Node *pants=new Node("pants");
	Node *belt=new Node("belt");
	Node *socks=new Node("socks");
	Node *shoes=new Node("shoes");
	Node *shirt=new Node("shirt");
	Node *tie=new Node("tie");
	undershorts->vecAdj.push_back(pants);undershorts->vecAdj.push_back(shoes);
	pants->vecAdj.push_back(belt);pants->vecAdj.push_back(shoes);
	belt->vecAdj.push_back(jacket);
	socks->vecAdj.push_back(shoes);
	shirt->vecAdj.push_back(belt);shirt->vecAdj.push_back(tie);
	tie->vecAdj.push_back(jacket);
	vector<Node*> vecQ;
	vecQ.push_back(jacket);
	vecQ.push_back(undershorts);
	vecQ.push_back(pants);
	vecQ.push_back(belt);
	vecQ.push_back(socks);
	vecQ.push_back(shoes);
	vecQ.push_back(shirt);
	vecQ.push_back(tie);
	//kaishiole 
	for(vector<Node*>::iterator it=vecQ.begin();it<vecQ.end();it++)
	{
		if( (*it)->color=="white")
		DFS(vecQ,(*it));
	}
	Node *bit=shoes;
	bit=belt;
	while( bit != NULL )
	{
		cout<<bit->data<<" ";
		bit=bit->p;
	}
	cout<<endl;
	system("pause");
	//根据finish排序，就是拓扑排序
}
void DFS(vector<Node*> vecQ,Node *u)
{
	u->color="gray";
	time++;
	u->begin=time;
	for(vector<Node*>::iterator ict=u->vecAdj.begin();ict<u->vecAdj.end();ict++)
	{
		if( (*ict)->color == "white" )
		{
			(*ict)->p=u;
			DFS( vecQ,(*ict) );
		}
	}
	u->color="black";
	time++;
	u->finish=time;
}