poj 1094 拓扑排序

最新推荐文章于 2020-02-05 16:03:02 发布

阿欣

最新推荐文章于 2020-02-05 16:03:02 发布

阅读量527

点赞数

分类专栏： LINUX

本文链接：https://blog.csdn.net/csjiaxin/article/details/11148633

版权

LINUX 专栏收录该内容

23 篇文章 0 订阅

订阅专栏

深度搜索可以得到拓扑排序
深度搜索可以判断图是否存在环

#include <iostream>
#include <list>
using namespace std;

#define MAX_VERTEX 26
#define WHITE 0
#define GRAY 1
#define BLACK 2

class graph
{
public:

int colors[MAX_VERTEX];
char vertexArray[MAX_VERTEX];
char adjMatrix[MAX_VERTEX][MAX_VERTEX];

graph()
{
for(int i=0;i<MAX_VERTEX;i++)
{
colors[i]=0;
vertexArray[i] = 0;

for(int j=0;j<MAX_VERTEX;j++)
adjMatrix[i][j]=0;
}
}
void addEdge(int f,int t)
{
vertexArray[f]=1;
vertexArray[t]=1;
adjMatrix[f][t] = 1;
}

};

int v_to_index(char v)
{
return v-'A';
}

char index_to_v(int index)
{
return index+'A';
}

void clear_color(graph& G)
{
for(int i=0;i<MAX_VERTEX;i++)
{
G.colors[i] = WHITE;
}
}
void dump_index(int index,string msg)
{
//cout<<index_to_v(index)<<" "<<msg<<endl;
}
int dfsVisit(graph& G,int vertex,list<int>& dfsList)
{
G.colors[vertex] = GRAY;
dump_index(vertex,"GRAY");

for(int j=0;j<MAX_VERTEX;j++)
{
if(G.adjMatrix[vertex][j] != 0)
{
if(G.colors[j] == BLACK)
{
continue;
}
else if (G.colors[j] == GRAY)
{
dump_index(j,"GRAY RETURN");
return 1;
}

if(dfsVisit(G,j,dfsList) != 0)
{
return 1;
}
}
}

G.colors[vertex] = BLACK;

dfsList.push_front(vertex);
dump_index(vertex,"BLACK");

return 0;
}

int dfs(graph &G,list<int>& dfsList)
{
clear_color(G);

for(int i=0;i<MAX_VERTEX;i++)
{
if(G.vertexArray[i] != 0 && G.colors[i] == WHITE)
{
dump_index(i,"dfs");
int ret = dfsVisit(G,i,dfsList);
if(ret != 0)
return ret;
}
}

return 0;
}

int main()
{
int n,m;
while(cin>>n>>m)
{
string str;
graph G;
int end=0;

if(n==0)
break;

for(int i=0;i<m;i++)
{

cin>>str;

if(end)
continue;
G.addEdge(v_to_index(str[0]),v_to_index(str[2]));

list<int> dfsList;

if(dfs(G,dfsList))
{
cout <<"Inconsistency found after "<<i+1<<" relations."<<endl;
end=1;
}
else if(dfsList.size() == n)
{
cout<<"Sorted sequence determined after "<<i+1<<" relations: ";

list<int>::iterator iterList;

for(iterList = dfsList.begin();iterList != dfsList.end();++iterList)
{
cout<<index_to_v((*iterList));
}
cout<<"."<<endl;

end=1;
}

}

if(end == 0)
{
cout<<"Sorted sequence cannot be determined."<<endl;
}
}
}

阅读(17) | 评论(0) | 转发(0) |

上一篇：Shell 脚本编程诀窍第4章通配符扩展

下一篇：poj 1789 prim 图最小生成树算法