generateung.cpp

来自「实现图的广度优先遍历:数据结构课程设计」· C++ 代码 · 共 49 行

#include"ALGraph.h"
using namespace std;
extern int getRightInput(int,int);
void generateUnG(ALGraph &G)
{
	//输入无向图
	system("cls");
	cout<<"    请输入该无向图的信息!"<<endl;
	G.kind =0;	//无向图
	G.arcnum =0;	
	cout<<"请输入图的顶点数目(2-20)： ";
	G.vexnum=getRightInput(2,20);	
	for( int i=0;i<G.vexnum;i++)
	{
		G.vertices [i].firstarc=NULL;
		G.vertices [i].data=i;		//顶点的信息就是顶点存取的位置
	}
	for(i=0;i<G.vexnum;i++)
	{
		for(int j=i+1;j<G.vexnum ;j++)
		{
			cout<<"第"<<i+1<<"个顶点与第"<<j+1<<"个顶点有关系吗？"<<endl;
			cout<<"有关系，输入1；没关系，输入0:  ";
			char relative;
			do{
				relative=(char)getch();
			}while(relative!='0'&&relative!='1');
			cout<<relative<<endl;
			if(relative=='1')		
			{		
				//采用头插法进行链接节点
				ArcNode *arcNode=(ArcNode *)malloc(sizeof(ArcNode));
				arcNode->nextarc =G.vertices [i].firstarc;
				G.vertices [i].firstarc=arcNode;
				arcNode->adjvex =j;
				G.arcnum ++;
				
				ArcNode *arcNode1=(ArcNode *)malloc(sizeof(ArcNode));
				arcNode1->nextarc =G.vertices[j].firstarc ;
				G.vertices [j].firstarc=arcNode1;
				arcNode1->adjvex =i;
				G.arcnum ++;
			}
		}
	}
	cout<<endl<<"输入结束！"<<endl;
	system("pause");
}