#include<iostream>
#include<fstream>
#define MAX 40
#define Null 0
int visited[MAX]; //0表示未访问,1表示已经访问
using namespace std;
typedef struct ArcNode
{
int adjvex; //该弧所指向的顶点的位置
struct ArcNode *nextarc;//指向下一条弧的指针
}ArcNode;
typedef struct VNode
{
string data; //顶点信息
struct ArcNode *firstarc;//指向第一条依附该顶点的弧的指针
}VNode,AdjList[MAX];
typedef struct
{
AdjList vertices;
int vexum,arcnum;//图的当前顶点数和弧数
int kind;
}AlGraph;
//创建有向图
void CreateGraph(AlGraph &G,int num)
{
ifstream infile("in.txt");
int n;
ArcNode *p;
for(int i=0;i<num;i++)
{
cout<<"请输入第"<<i+1<<"个顶点的数据"<<endl;
cin>>G.vertices[i].data;
//G.vertices[i].firstarc=Null;
cout<<"请输入以"<<i+1<<"为弧尾的顶点个数"<<endl;
cin>>n;
//p=(ArcNode*)malloc(n*sizeof(ArcNode));
p=G.vertices[i].firstarc=new ArcNode;
for(int j=0;j<n;j++)
{
cout<<"输入以"<<G.vertices[i].data<<"为弧尾的顶点"<<endl;
cin>>p->adjvex;
p=p->nextarc=new ArcNode;
}
}
}
void Visit(int v)
{
cout<<v<<" ";
}
void DFS(AlGraph G,int v)
{
ArcNode *p;
p=G.vertices[v].firstarc;
visited[v]=1;
Visit(v);
for(int w=p->adjvex;w>=0;w=p->nextarc->adjvex)
{
// cout<<"this is w: "<<w<<endl;
if(!visited[w])
DFS(G,w);
}
}
void DFSTraverse(AlGraph G)
{
int v;
for(v=0;v<G.vexum;v++)
visited[v]=0;
for(v=0;v<G.vexum;v++)
if(!visited[v])
DFS(G,v);
}
int main()
{
AlGraph G;
cout<<"输入顶点个数: "<<endl;
cin>>G.vexum;
CreateGraph(G,G.vexum);
DFSTraverse(G);
return 0;
}
/*int FirstAdjVex(AlGraph G,int v)
{
return G.vertices[v].firstarc->adjvex;
}
int NextAdjVex(AlGraph G,int v,int w)
{
w=G.vertices[v].firstarc->adjvex;
return G.vertices[w].firstarc->adjvex;
}
void DFS(AlGraph G,int v)
{
visited[v]=1;
Visit(v);
for(int w=FirstAdjVex(G,v);w>0;w=NextAdjVex(G,v,w))
if(!visited[w])
DFS(G,w);
}
void DFSTraverse(AlGraph G)
{
int v;
for(v=0;v<G.vexum;v++)
visited[v]=0;//访问标识数组初始化0代表未访问
for(v=0;v<G.vexum;v++)
if(!visited[v])
DFS(G,v);//对尚未访问的顶点调用DFS
}*/