main.cpp

来自「一个我的数据结构解题集合」· C++ 代码 · 共 41 行

#include <iostream>
#include <string>
#include "IoUtils.h"
#include "Graph.h"
using namespace std;

void print(int i) {
	cout << i << " ";
} // print(int)

int main() {
	Graph<int> g;

	cout << "本程序演示图的深度优先和广度优先遍历，"
		 << "输出各个遍历所经过的结点顺序，以数字代表结点，"
		 << "当输入中有一个负数时输入结束"
		 << endl;
	
	int v1, v2;
	while (true) {
		cout << "输入起始结点: ";
		v1 = getInteger();
		cout << "输入终止结点: ";
		v2 = getInteger();
		if (v1 < 0 || v2 < 0)
			break;
		g.insert(v1, v2);
	}
	
	cout << "深度优先遍历结果: \n";
	g.depthFirstTraverse(print);
	cout << endl;

	cout << "广度优先遍历结果: \n";
	g.breadthFirstTraverse(print);

	pause();
	return 0;

} // main()