main.cpp

求图的强连通分支

#include"graph.h"

int main(){
Graph<int,int> graph(-1,-1);
int num;
char inFileName[]="data3.txt";
ifstream inFile;
inFile.open(inFileName);
if(!inFile.is_open()){
cout<<"File open error!"<<endl;
cout<<"Opreation is terminating!"<<endl;
exit(EXIT_FAILURE);
}

inFile>>num;

int *vers;
vers=new int[num];
for(int i=0;i<num;i++){
vers[i]=num-1-i;
}
graph.CreateGraph(vers ,num);
inFile.get();//跳过‘\n’
int x ,y;
char a=inFile.get();
while(a!=EOF){
switch(a){
    case '(':inFile>>x;
	     break;
    case ',':inFile>>y;
			cout<<x<<"     "<<y<<endl;
			graph.InsertEdge(x,y);
	   break;
    case ')':inFile.get();
		break;
}a=inFile.get();}
graph.DFS_Traveling(0);
graph.StronglyConnectedComponents();
graph.OutputComponent();
return 0;}