test.cpp

来自「树的操作中的邻接表。。解压即可。。直接上交」· C++ 代码 · 共 28 行

#include "ALGraph.cpp"

main()
{ string ss[5]={"0","1","2","3","4"};
	vector<string> vs(ss,ss+5);
  ALGraph<string> G(vs);
	
	Edge es[9]={{0,3,1},{0,1,1},
							{1,2,1},{1,3,1},{1,4,1},
							{2,1,1},
							{3,0,1},{3,1,1},
							{4,1,1}
							};
  vector<Edge> edges(es,es+9);
  G.Append(edges);
  G.Output();
	cout<<G.OutDegree(1)<<","<<G.InDegree(1)<<endl; 
	vector<string> dfs=G.DFSTraverse();
	for(int i=0; i<dfs.size(); i++)
		cout<<dfs[i]<<" ";
	cout<<endl;

	vector<string> bfs=G.BFSTraverse();
	for(i=0; i<bfs.size(); i++)
		cout<<bfs[i]<<" ";
	cout<<endl;
}