数据结构实验四

#include <stdio.h>
#include <stdlib.h>
#define MAX 100
typedef struct{
char vexs[MAX];
int arcs[MAX][MAX];
int vexnum,arcnum;
}MGraph;
typedef struct ArcNode{
int adjvex;
int weight;
struct ArcNode *nextarc;
}ArcNode;
//p163
int LocateVex(MGraph G,int v){
//查找顶点在无向图G中的位置
for(int i=0;i<G.vexnum;i++)
if(G.vexs[i]==v)
return i;
return -1;
}//LocateVex
void CreateGraph(MGraph &G){
//根据输入的顶点数和边数，建立无向图G的邻接矩阵
int i,k,j;
char u,v;
scanf("%d%d",&G.vexnum,&G.arcnum);
gerchar();
for(i=0;i<G.vexnum;i++)
scanf(&G.vexs[i]);
for(i=0;i<G.vexnum;i++)
for(j=0;j<G.vexnum;j++)
G.arcs[i][j]=0;
for(k=0;k<G.arcnum;k++){
scanf(&u,&v);
i=LocateVex(G,u);
if(i==-1){
printf("error\n"); return;
}
j=LocateVex(G,v);
if(j==-1){
printf("error\n"); return;
}
G.arcs[i][j]=G.arcs[j][i]=1;
}//for
}//CreateGraph
int FirstAdjVex(MGraph G,int v){
//在无向图G中查找顶点v的第一个临界点
for(int j=0;j<G.vexnum;j++)
if(G.arcs[v][j]==1)
return j;
return -1;
}//FirstAdjVex
int NextAdjVex(MGraph G,int v,int w){
//在图G中查找相对于w的下一个邻接点
for(int j=w+1;j<G.vexnum;j++)
if(G.arcs[v][j]==1)
return j;
return 1;
}//NextAdjVex
int main(){
MGraph G;
CreateGraph(G);
}

#include <stdio.h>
#include <stdlib.h>
#define MAX 100
typedef struct{
char vexs[MAX];
int arcs[MAX][MAX];
int vexnum,arcnum;
}MGraph;
typedef struct ArcNode{
int adjvex;
int weight;
struct ArcNode *nextarc;
}ArcNode;
typedef struct VNode{
VertexType data;
ArcNode *firstare;
}VNode;
typedef struct{
VNode vertices[MAX];
int vexnum,arcnum;
}ALGraph;
int LocateVex(MGraph G,int v){
//查找顶点在无向图G中的位置
for(int i=0;i<G.vexnum;i++)
if(G.vexs[i]==v)
return i;
return -1;
}//LocateVex
void CreateGraph(MGraph &G){
//根据输入的顶点数和边数，建立无向图G的邻接矩阵
int i,k,j;
char u,v;
scanf("%d%d",&G.vexnum,&G.arcnum);
getchar();
for(i=0;i<G.vexnum;i++)
scanf(&G.vexs[i]);
for(i=0;i<G.vexnum;i++)
for(j=0;j<G.vexnum;j++)
G.arcs[i][j]=0;
for(k=0;k<G.arcnum;k++){
scanf(&u,&v);
i=LocateVex(G,u);
if(i==-1){
printf("error\n"); return;
}
j=LocateVex(G,v);
if(j==-1){
printf("error\n"); return;
}
G.arcs[i][j]=G.arcs[j][i]=1;
}//for
}//CreateGraph
/*int FirstAdjVex(MGraph G,int v){
//在无向图G中查找顶点v的第一个临界点
for(int j=0;j<G.vexnum;j++)
if(G.arcs[v][j]==1)
return j;
return -1;
}//FirstAdjVex
int NextAdjVex(MGraph G,int v,int w){
//在图G中查找相对于w的下一个邻接点
for(int j=w+1;j<G.vexnum;j++)
if(G.arcs[v][j]==1)
return j;
return 1;
}//NextAdjVex*/
void CreateGraphhave(ALGraph &G){
//根据输入的顶点数和弧数，建立有向图G的邻接表
scanf("%d%d",&G,vexnum,&G.arcnum);
for(i=0;i<G.vexnum;i++){
scanf(&G.vertices[i].data);
G.vertices[i].firstare=NULL;
} //for
for(k=0;k<G.arcnum;k++){
scanf(&u,&v);
i=LocateVex(G,u);
if(i==-1){printf("error\n"); return;}
j=LocateVex(G,v);
if(j==-1){printf("error\n"); return;}
s=(ArcNode*)malloc(sizeof(ArcNode));
S->adivex=j; s->nextare=NULL;
if(!G.vertices[i].firstare)
G.vertices[i].firstare=s;
else{
p=G.vertices[i].firstare;
while(p->nextarc) p=p->nextarc;
p->nextarc=s;
}//else
}//for
}//CreateGraph
int visited[MAX];
void DFSTraverse(Graph G){
//深度优先遍历图G
for(v=0;v<G.vexnum;v++)
visited[v]=0;
for(v=0;v<G.vexnum;v++)
if(!visited[v]) DFS(G,v);
}//DFSTraverse
void DFS(ALGraph G,int v){
//从
}
int main(){
//int v,w;
MGraph G;
CreateGraph(G);
//FirstAdjVex(G,v);
//NextAdjVex(G,v,w);
}