bianli.cpp

主要是图的建立

#include <iostream.h>
#include <stdlib.h>

typedef char DataType;
const int MaxQueueSize = 100;
const int MaxVertices = 100;
#include "SeqQueue.h"


typedef char VerT;
typedef int DistT;

#include "AdjMWGraph.h"

void main(void)
{
	AdjMWGraph g;
	char a[] = {'A','B','C','D','E','F','G'};
	RowColWeight rcw[] = {{0,1,1},{0,2,1},{1,3,1},{1,4,1},{2,5,1},{2,6,1},{1,0,1},{2,0,1},{3,1,1},{4,1,1},{5,2,1},{6,2,1}};
	int n = 7,e = 12;
	int i;
	CreatGraph(g,a,n,rcw,e);

	cout<<"当前的顶点个数为："<<g.NumOfVertices()<<endl;
	cout<<"当前的顶点个数为："<<g.NumOfEdges()<<endl;
 
	cout<<"深度优先搜索序列为：";
	int *visited = new int[g.NumOfVertices()];
	for(i = 0;i < g.NumOfVertices();i++) visited[i] = 0;
	g.DepthFirstSearch(0,visited,Printchar);
	cout<<"广度优先搜索序列为：";
/*	for(i = 0;i < g.NumOfVertices();i++) visited[i] = 0;
	g.BroadFirstSearch(0,visited,Printchar);
*/
	g.DeleteEdge(0,2);
	g.DeleteEdge(2,0);
	cout<<"\n\n删除边<0,2>和<2,0>后";
	cout<<endl<<"当前的顶点个数为："<<g.NumOfVertices();
	cout<<endl<<"当前的顶点个数为："<<g.NumOfEdges()<<endl;


	cout<<"非连通图的深度优先搜索序列为：";
	g.DepthFirstSearch(Printchar);
//	cout<<"非连通图的广度优先搜索序列为：";
//	g.BroadFirstSearch(Printchar);
}