#include"Graph2.h"
int main() {
	//Graph<char,int>graph(DefaultSize);
	//graph.Count();
	//cout<<"深度優先搜索\n";
	//graph.DFS();
	//cout<<"\n廣度優先搜索\n";
	//graph.BFS(0);
	//cout<<endl;
	Graph<char,int>graph1(DefaultSize);
	graph1.Count();
	cout<<"\n有向無環圖的拓撲排序\n";
	graph1.TopologicalSort();
	return 0;
}