拓扑排序邻接表建图(bfs)

# include<iostream>
# include<queue>
# include<vector>
# include<cstring>
using namespace std;
const int maxn=100+5;
//定义弧的数据结构 
typedef struct arcnode{ 
	int adjnode;   //该弧指向的节点索引 
	arcnode *nextarc; //指向下一条弧 
}arcnode;
typedef struct node{
	int data;
     arcnode *firstarc; 
}node;
typedef struct graph{
	node vertex[maxn];//顶点集 
	int vertexnum;   //顶点数 
	int edgenum; //边数 
}graph;
vector<int> ss;
queue<int>  q;
int degree[maxn]; 
int find(graph g,int i)  //寻找对应顶点的索引 
{
	for(int j=0;j<g.vertexnum;j++)
	    if(g.vertex[j].data==i)
	      return j;
	return -1;
}
void init(graph &g)
{
	cin>>g.vertexnum>>g.edgenum;
	for(int i=0;i<g.vertexnum;i++)
	 {
	 	cin>>g.vertex[i].data;
	 	g.vertex[i].firstarc=NULL;
	 }
	for(int i=0;i<g.edgenum;i++)
	{
		int u,v;
		arcnode *s=new arcnode();   //分配节点空间 
		cin>>u>>v;    //输入u->v的边的顶点 
		int index_u=find(g,u);   //查找顶点 u,v的索引 
		int index_v=find(g,v);
		s->adjnode=index_v;
		s->nextarc=g.vertex[index_u].firstarc;
		g.vertex[index_u].firstarc=s;
	}
}
//检查邻接表是否出错 
/*void  output(graph g)
{
	for(int i=0;i<g.vertexnum;i++)
	{
		cout<<g.vertex[i].data;
		arcnode *s;
		s=g.vertex[i].firstarc;
		while(s)
		{
			cout<<"->"<<g.vertex[s->adjnode].data;
			s=s->nextarc;
		}
		cout<<endl;	
	  }
}*/
void finddegree(graph g,int degree[])
{
	int sum;
	for(int i=0;i<g.vertexnum;i++)
	{
		sum=0;
		for(int j=0;j<g.vertexnum;j++)
		{
			arcnode *s;
			s=g.vertex[j].firstarc;
			while(s)
			{
				if(s->adjnode==i)
				 {
				 	 sum++;
				 	 break;
				   } 
		    s=s->nextarc;	
			}
			
		}
		degree[i]=sum;
	}
}
bool  toposort(graph g)
{
	int cnt=0;
	for(int i=0;i<g.vertexnum;i++)
	   if(degree[i]==0) q.push(i);
	while(!q.empty())
	{
		int j=q.front();
		q.pop();
	    ss.push_back(g.vertex[j].data);
	    cnt++;
		arcnode *s;
		s=g.vertex[j].firstarc;
		while(s)
		{
			degree[s->adjnode]--;
			if(degree[s->adjnode]==0)
			   q.push(s->adjnode);
			s=s->nextarc;
		}
		
	}
	
	if(cnt<g.vertexnum)
	  return false;
	return true;
}
int main()
{
	graph g;
	init(g);
	memset(degree,0,sizeof(degree));
	finddegree(g,degree);
	/*for(int i=0;i<g.vertexnum;i++)
	    cout<<degree[i]<<endl;*/
    if(toposort(g))
	  {
		for(vector<int>::iterator in=ss.begin();in!=ss.end();in++)
		   cout<<*in<<" ";
	   }
	else cout<<"存在回路"<<endl;
	//output(g);
	return 0;
 }