📄 graphtest.cpp
字号:
#include <iostream.h>
#include <stdlib.h>
typedef char VerT;
typedef char DataType;
const int MaxVertices = 100;
const int MaxWeight = 10000;
const int MaxQueueSize = 100;
#include "AdjMWGraph.h"
#include "CreatAdjMWGraph.h"
void Printchar(char item)
{
cout << item<<" ";
}
void main(void)
{
AdjMWGraph g;
char a[] = {'A','B','C','D','E'};
RowColWeight rcw[] = {{0,1,10},{0,4,20},{1,3,30},{2,1,40},{3,2,50}};
int n = 5, e = 5;
CreatGraph(g, a, n, rcw, e);
cout << "顶点个数为:" << g.NumOfVertices() << endl;
cout << "边的条数为:" << g.NumOfEdges() << endl;
cout << "深度优先搜索序列为:";
g.DepthFirstSearch(Printchar);
cout << endl << "广度优先搜索序列为:";
g.BroadFirstSearch(Printchar);
g.DeleteVertex(3);
g.DeleteEdge(0, 4);
cout << endl << "顶点个数为:" << g.NumOfVertices();
cout << endl << "边的条数为:" << g.NumOfEdges()<< endl;
cout << "深度优先搜索序列为:";
g.DepthFirstSearch(Printchar);
cout << endl << "广度优先搜索序列为:";
g.BroadFirstSearch(Printchar);
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -