#include <iostream>
#include<queue>
#include<stack>
using namespace std;
#define E 100 //圖的邊數
#define N 100//圖的頂點數
typedef char vextype; //頂點的數據類型
typedef float adjtype; //邊的權值數據類型
//圖的結構體定義
typedef struct
{
vextype vexs[N]; //頂點信息
adjtype adjs[N][N]; //領接矩陣
} graph;
//需要定義爲全局變量
graph *g = new graph;
int visit[N]; //輔助數組,標記點是否已經被訪問
int n,m;
void Creat_graph(graph *g);
void DFSA(int i);
void DFSA(int i);
bool topoSort();
int main(int argc, char** argv)
{
Creat_graph(g);
cout<<"圖g的頂點爲:";
for (int i = 0; i < 4; ++i)
{
cout<<g->vexs[i]<<" ";
}
cout<<endl;
//圖的遍歷算法,傳入圖和指定的起始遍歷頂點序號
DFSA(0);
cout<<"拓撲排序: "<<endl;
topoSort();
delete g;
system("pause");
return 0;
}
bool topoSort()
{
int indo[N];
memset(indo,0,sizeof(indo));
stack<int> st;
for(int i=0; i<n; i++)
{
for(int j=0; j<n; j++)
if(g->adjs[i][j])
indo[j]++;
}
for(int i=0; i<n; i++)
{
if(indo[i]==0)
{
st.push(i);
}
}
int icount=0;
while(!st.empty())
{
int vv=st.top();
st.pop();
icount++;
cout<<g->vexs[vv]<<" "<<endl;
for(int i=0; i<n; i++)
{
if(g->adjs[vv][i])
{
indo[i]--;
if(indo[i]==0) st.push(i);
}
}
}
if(icount<n) return false;
return true;
}
//初始化無向圖
void Creat_graph(graph *g)
{
//輸入頂點信息
char temp_char;
cin>>n;
for (int i = 0; i < n; ++i)
{
g->vexs[i] = 'A'+i;
}
//初始化鄰接矩陣
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
{
g->adjs[i][j] = 0;
}
}
//寫入鄰接矩陣
int vex1,vex2;//邊的頂點
float w;//權值
cin>>m;
for (int k = 0; k < m; ++k)
{
scanf("%d%d%f",&vex1,&vex2,&w);//格式化輸入,很方便
g->adjs[vex1][vex2] = w;
//g->adjs[vex2][vex1] = w;
//若建立有向圖,則將最後一賦值語句去掉即可,可以將w的值設爲1,變成無向圖
}
}
void DFSA(int i)
{
visit[i] = 1;
cout<<g->vexs[i]<<" ";
for (int j = 0; j < N; ++j)//依次遍歷i頂點的鄰接點
{
if ((g->adjs[i][j]!=0) && (visit[j]==0))//與i相連且未被訪問過
{
DFSA(j);
}
}
}
void BFSA(int k)
{
queue<int> Q;
int i,j;
cout<<"訪問出發頂點序號: "<<k<<endl;
visit[k] = 1;
while (!Q.empty())
{
i = Q.front();
Q.pop();
for (j = 0; j < n; ++j)
{
if ((g->adjs[i][j]!=0) && (visit[j]==0))//與i相連且未被訪問過
{
visit[j] = 1;
Q.push(j);
}
}
}
}