数据结构--图的遍历

#include "stdafx.h"
#include "iostream.h"

#define OK    1
#define ERROR 0
#define TRUE  1
#define FALSE 0

#define INFINITY  999999
#define MaxSize 100
typedef enum {DG,DN,UDG,UDN} GraphKind;
typedef struct
{
char vexs[MaxSize];
int arcs[MaxSize][MaxSize];
int vexnum;
int arcnum;
GraphKind kind;
}AdjMatrix;

int CreatDG(AdjMatrix& G)
{
;
return OK;
}

int CreatDN(AdjMatrix& G)
{
return OK;

}

int CreatUDG(AdjMatrix& G)
{
return OK;
}

int CreatUDN(AdjMatrix& G)
{
cout<<endl<<"请输入顶点数:";
cin>>G.vexnum;
cout<<endl<<"请输入边数:";
cin>>G.arcnum;

for(int i=1;i<=G.vexnum;i++)
{
cout<<endl<<"请输入第"<<i<<"个顶点的值:";
cin>>G.vexs[i-1];
}

for(i=0;i<G.vexnum;i++)
for(int j=0;j<G.vexnum;j++)
G.arcs[i][j]=INFINITY;

int Col,line;
for(i=1;i<=G.arcnum;i++)
{
cout<<endl<<"请输入第"<<i<<"条边对应的行值:";
cin>>line;
cout<<endl<<"请输入第"<<i<<"条边对应的列值:";